Gödel's Incompleteness

Climb from logical connectives and first-order logic through Cantor's diagonal and self-reference to the theorem that every rich, consistent system has true statements it cannot prove.

Topics on this path

1. Quantifiers & First-Order Translation
2. Self-Reference Paradoxes
3. Cantor's Diagonal Argument
4. Turing Machines
5. Decidability & the Halting Problem
6. Gödel's Incompleteness