Gödel's Incompleteness Theorems

Practical information

Thursdays, from 2pm to 4pm (s.t., includes practice sessions)

Office hours by appointment, in room 234, Ludwigstrasse 31, second floor

You can find the book here.

Here's a cool video. Very instructive! (Credits to Nico González Albornoz)

Course description

The course consists in a detailed exposition of Gödel's first incompleteness theorem and its proof. The result establishes that any theory extending elementary arithmetic is incomplete, this is, there will always be a sentence in the language of the theory that the theory neither proves nor refutes.

The exposition is carried out in two steps. First, an introduction to first-order arithmetic is given. Students are presented with the following: first-order axiomatic theories, the language of first-order arithmetic, L, first-order theories of arithmetic Q (Robinson Arithmetic) and PA (for "Peano Arithmetic"), the enumerability and denumerability of sets, the recursivity, semi-recursivity, definability in L, and representability in an axiomatic theory formulated in L, of a subset of natural numbers or a function from natural numbers to natural numbers, the standard model of L, arithmetical truth, the arithmetical hierarchy, and (primitive) recursive functions.

The second half of the course consists of a presentation of a modern version of Gödel's proof, followed by a reflection on the philosophical consequences of the incompleteness result. Students are introduced to Q's Sigma1-completeness, Gödel's coding technique and the arithmetisation of syntax, the diagonalisation lemmata, and Gödel sentences.

Course material

Contents (preliminary)

1. Introduction: What Gödel's Theorems Say

12/4

2. Functions and Enumerations

19/4

Exercises: about functions and enumerability (except exercise 5).

3. Effective Computability and Axiomatic Theories: Axiomatisability and Decidability

26/4

Read: Smith's (2013), Chapters 3 and 4.

Exercises: about effective computability (except exercise 5) and formal theories.

4. Expressing and Capturing Numerical Properties

3/5

Exercises: about the language of arithmetic.

5. Subsystems of First-order Peano Arithmetic PA

17/5 - 7/6

Read: Smith's (2013), Chapters 9, 10, 11, 12, and 13.

Exercise: read and prepare a summary of chapters 6, 7, and 8 to briefly explain their content in class (note that there are two bank holidays).

Exercises: about sufficiently expressive/strong theories, induction, and Robinson Arithmetic. Also, try to prove that BA captures the identity relation, that it is negation-complete, and principles O1-O9 from sec. 11.3 (this homework was given in class). Bonus: evaluate whether Q proves this formula.

Exercises: prove Theorems 11.6, 12.1, and 12.3.

6. Primitive Recursive Functions

14/6 - 21/6

Exercises: complete the proof of claims A-E in sec. 14.7, and (iv) examples 1-6 in sec. 14.8.

7. Capturing Primitive Recursive Functions

25/6

8. The Arithmetization of Syntax

28/6 - 5/7

Read: Smith (2013), Chapters 19 and 20.

9. Gödel's First Incompleteness Theorem

12/7

Preparing for the course