Useful Links
Mathematics
Mathematical Logic
1. Introduction to Mathematical Logic
2. Propositional Logic
3. First-Order Logic
4. Model Theory
5. Computability Theory
6. Incompleteness Theorems
7. Axiomatic Set Theory
8. Proof Theory
9. Modal Logic
10. Intuitionistic Logic
11. Higher-Order Logic
Incompleteness Theorems
Formal Theories of Arithmetic
Robinson Arithmetic
Axioms and Properties
Undecidability
Peano Arithmetic
First-Order Axioms
Induction Schema
Strength and Limitations
Non-Standard Models of Arithmetic
Existence and Properties
Overspill Principle
Representability of Computable Functions
Definition of Representability
Examples in Arithmetic
Representability Theorem
Gödel Numbering
Encoding Formulas and Proofs
Properties of Gödel Numbering
Primitive Recursive Relations
The Diagonal Lemma
Statement and Proof Outline
Role in Incompleteness Proofs
Fixed Point Theorem
Gödel's First Incompleteness Theorem
Construction of the Gödel Sentence
Proof of the Theorem
Consequences for Formal Systems
Incompleteness of Arithmetic
Limitations of Formalization
Rosser's Improvement
Gödel's Second Incompleteness Theorem
Formalizing Consistency
The Unprovability of Consistency
Hilbert's Program
Derivability Conditions
Related Results
Tarski's Undefinability of Truth
Statement and Implications
Hierarchy of Truth Predicates
Löb's Theorem
Statement and Applications
Provability Logic
Previous
5. Computability Theory
Go to top
Next
7. Axiomatic Set Theory