I: The General Idea Behind Gödel's Proof; II: Tarski's Theorem for Arithmetic; III: The Incompleteness of Peano Arithmetic With Exponentiation; IV: Arithmetic Without the Exponential; V: Gödel's Proof Based on?-Consistency; VI: Rosser Systems; VII: Shepherdson's Representation Theorems; VIII: Definablity and Diagonalization; IX: The Unprovability of Consistency; X: Some General Remarks on Provability and Truth; XI: Self-Referential Systems; References; Index
Summary
An introduction to the work of the mathematical logician Kurt Godel, which guides the reader through his Theorem of Undecidability and his theories on the completeness of logic, the incompleteness of numbers and the consistency of the axiom of choice