• 1. The general idea behind Godel's proof ; 2. Tarski's theorem for arithmetic ; 3. The incompleteness of peano arithmetic with exponentation ; 4. Arithmetic without the exponential ; 5. Godel's proof based on consistency ; 6. Rosser systems ; 7. Shepherdson's Representation theorems ; 8. Definability and diagonalization ; 9. The unprovability of consistency ; 10. Some general remarks on provability and truth ; 11. Self-referential systems

'rigorously developed, yet pedagogically sensitive; carefully structured, yet elegantly presented ... fine introductions to areas that are of central importance to contemporary classical logic and foundations of mathematics Gödel's incompleteness theorems, is noteworthy for its unusually straight-forward presentations of some of the most intellectually rewarding results proved this century'A.D. Irvine, University of British Columbia, History and Philosophy of Logic, 15 (1994)