书目名称 | Logical Foundations of Mathematics and Computational Complexity |
副标题 | A Gentle Introductio |
编辑 | Pavel Pudlák |
视频video | |
概述 | Presents a wide range of results in logic and computational complexity.Explains the topic informally and then in more detail for the advanced reader.Presents the ideas behind the theoretical concepts. |
丛书名称 | Springer Monographs in Mathematics |
图书封面 |  |
描述 | .The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. .Logical Foundations of Mathematics and Computational Complexity. covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability..Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs..Logical Foundations of Mathematics and Computational Complexity. is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and |
出版日期 | Book 2013 |
关键词 | Complexity of Proofs; Computational Complexity; Foundations of Mathematics; Incompleteness Theorems; Mat |
版次 | 1 |
doi | https://doi.org/10.1007/978-3-319-00119-7 |
isbn_softcover | 978-3-319-34268-9 |
isbn_ebook | 978-3-319-00119-7Series ISSN 1439-7382 Series E-ISSN 2196-9922 |
issn_series | 1439-7382 |
copyright | Springer International Publishing Switzerland 2013 |