000 03915nam a22005175i 4500
001 978-3-031-64217-3
003 DE-He213
005 20251030112923.0
007 cr nn 008mamaa
008 240831s2024 sz | s |||| 0|eng d
020 _a9783031642173
_9978-3-031-64217-3
024 7 _a10.1007/978-3-031-64217-3
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBCD
_2bicssc
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBCD
_2thema
072 7 _aPBC
_2thema
100 1 _aBatzoglou, Serafim.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_983313
245 1 0 _aIntroduction to Incompleteness
_h[electronic resource] :
_bFrom Gödel's Theorems to Forcing and the Continuum Hypothesis /
_cby Serafim Batzoglou.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Birkhäuser,
_c2024.
300 _aXI, 302 p. 13 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aPart 1: Godel's Theorems -- Formal Axiomatic Systems -- Peano Arithmetic and Recursive Functions -- Godel's Incompleteness Theorems -- Structures, Models, and Satisfaction -- Completeness and Compactness Theorems -- Completeness and Peano Arithmetic -- The Lucas-Penrose Arguments -- Part II: Incompleteness in arithmetic and set theory -- Incompleteness in Finite Combinatorics -- Consistency of PA and E0 Induction -- Set Theory -- Independence of CH--forcing -- Independence of CH--forcing CH and -CH.
520 _aIncompleteness is a fascinating phenomenon at the intersection of mathematical foundations, computer science, and epistemology that places a limit on what is provable. However, despite its importance, it is often overlooked in the mathematics curricula because it is difficult to teach. This book aims to help bridge this pedagogical gap by providing a complete and accessible technical exposition of incompleteness for a wide audience. The author accomplishes this by making conceptually difficult proofs more approachable by providing intuitive explanations of the main ideas. Care is taken to emphasize the different layers of the mathematical argument – the layer within and the metalayer about an axiomatic system. Structurally, the book efficiently examines key results and arrives at some of the most interesting concepts as quickly as possible. It begins with Gödel's incompleteness theorems before continuing on to challenging concepts in the arithmetized completeness theorem, the Paris-Harrington theorem, and the independence of the continuum hypothesis. Other topics covered include the Lucas-Penrose arguments, ordinals and cardinals, and axiomatic set theory. Additionally, the author’s coverage of forcing is a notable addition to the existing literature. Introduction to Incompleteness will be of interest to researchers, students, and instructors looking for a resource to teach this topic. It may also be suitable for self-study. Knowledge of undergraduate-level theoretical mathematics or computer science is required, as well as a familiarity with abstract proofs.
650 0 _aMathematical logic.
_966195
650 0 _aSet theory.
650 1 4 _aMathematical Logic and Foundations.
_966198
650 2 4 _aSet Theory.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031642166
776 0 8 _iPrinted edition:
_z9783031642180
776 0 8 _iPrinted edition:
_z9783031642197
856 4 0 _uhttps://doi.org/10.1007/978-3-031-64217-3
912 _aZDB-2-SMA
912 _aZDB-2-SXMS
999 _c62917
_d62917