000 03292nam a22004937a 4500
001 sulb-eb0023191
003 BD-SySUS
005 20160413122339.0
007 cr nn 008mamaa
008 130423s2013 gw | s |||| 0|eng d
020 _a9783319001197
_9978-3-319-00119-7
024 7 _a10.1007/978-3-319-00119-7
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBC
_2bicssc
072 7 _aPBCD
_2bicssc
072 7 _aMAT018000
_2bisacsh
082 0 4 _a511.3
_223
100 1 _aPudlák, Pavel.
_eauthor.
245 1 0 _aLogical Foundations of Mathematics and Computational Complexity
_h[electronic resource] :
_bA Gentle Introduction /
_cby Pavel Pudlák.
264 1 _aHeidelberg :
_bSpringer International Publishing :
_bImprint: Springer,
_c2013.
300 _aXIV, 695 p. 49 illus., 4 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSpringer Monographs in Mathematics,
_x1439-7382
505 0 _aMathematician’s world -- Language, logic and computations -- Set theory -- Proofs of impossibility -- The complexity of computations -- Proof complexity -- Consistency, Truth and Existence -- References.
520 _aThe 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.
650 0 _aMathematics.
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 1 4 _aMathematics.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aMathematics of Algorithmic Complexity.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319001180
830 0 _aSpringer Monographs in Mathematics,
_x1439-7382
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-00119-7
912 _aZDB-2-SMA
942 _2Dewey Decimal Classification
_ceBooks
999 _c45283
_d45283