My Account Log in

1 option

Logical foundations of mathematics and computational complexity a gentle introduction Pavel Pudlák

Springer Nature - Springer Mathematics and Statistics (R0) eBooks 2013 English International Available online

View online
Format:
Book
Author/Creator:
Pudlák, Pavel, 1952-
Series:
Springer monographs in mathematics
Springer monographs in mathematics 1439-7382
Language:
English
Subjects (All):
Logic, Symbolic and mathematical.
Computational complexity.
Software.
software.
Medical Subjects:
Software.
Genre:
Software
Physical Description:
1 online resource
Place of Publication:
Cham New York Springer ©2013
Language Note:
English
System Details:
text file PDF
Summary:
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 foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory
Contents:
Mathematician's World Language, Logic and Computations Set Theory Proofs of Impossibility The Complexity of Computations Proof Complexity Consistency, Truth and Existence
Notes:
Includes bibliographical references and index
Print version record
Other Format:
Print version Pudlák, Pavel, 1952- Logical foundations of mathematics and computational complexity
ISBN:
9783319001197
3319001191
3319001183
9783319001180
OCLC:
841919382
Access Restriction:
Restricted for use by site license

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account