Godel's Incompleteness Theorems PDF

This Element takes a deep dive into Godel'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 Godel'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.