Gödel's Incompleteness theorems
This Element takes a deep dive into Gödel's 1931 paper giving the first presentation of the Incompleteness Theorems, opening up completely passages in it that might possibly puzzle the student, such as the mysterious footnote 48a. It considers the main ingredients of Gödel's proof: arithme...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2022
|
| Series: | Cambridge elements. Elements in philosophy and logic
|
| Subjects: | |
| Online Access: | |
| Collection: | Cambridge Books Online - Collection details see MPG.ReNa |
| LEADER | 01881nmm a2200265 u 4500 | ||
|---|---|---|---|
| 001 | EB002151068 | ||
| 003 | EBX01000000000000001289194 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr||||||||||||||||||||| | ||
| 008 | 230302 ||| eng | ||
| 020 | |a 9781108981972 | ||
| 050 | 4 | |a QA9.65 | |
| 100 | 1 | |a Kennedy, Juliette | |
| 245 | 0 | 0 | |a Gödel's Incompleteness theorems |c Juliette Kennedy |
| 260 | |a Cambridge |b Cambridge University Press |c 2022 | ||
| 300 | |a 80 pages |b digital | ||
| 653 | |a Gödel's theorem | ||
| 653 | |a Incompleteness theorems | ||
| 653 | |a Logic, Symbolic and mathematical | ||
| 041 | 0 | 7 | |a eng |2 ISO 639-2 |
| 989 | |b CBO |a Cambridge Books Online | ||
| 490 | 0 | |a Cambridge elements. Elements in philosophy and logic | |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108981972 |x Verlag |3 Volltext |
| 082 | 0 | |a 511.3 | |
| 520 | |a This Element takes a deep dive into Gödel's 1931 paper giving the first presentation of the Incompleteness Theorems, opening up completely passages in it that might possibly puzzle the student, such as the mysterious footnote 48a. It considers the main ingredients of Gödel's proof: arithmetization, strong representability, and the Fixed Point Theorem in a layered fashion, returning to their various aspects: semantic, syntactic, computational, philosophical and mathematical, as the topic arises. It samples some of the most important proofs of the Incompleteness Theorems, e.g. due to Kuratowski, Smullyan and Robinson, as well as newer proofs, also of other independent statements, due to H. Friedman, Weiermann and Paris-Harrington. It examines the question whether the incompleteness of e.g. Peano Arithmetic gives immediately the undecidability of the Entscheidungsproblem, as Kripke has recently argued. It considers set-theoretical incompleteness, and finally considers some of the philosophical consequences considered in the literature | ||