First-order theories, axioms IV, V models, skolem forms, Herband's Theorem,
completeness of first-order logic.
Peano Arithmetic, representability of arithmetic functions,
Gödel's first incompleteness theorem, Tarksi, and Church,
as regards computability.
Gödel's Theorem, original version.
Consistency: Hilbert-Bernays derivability conditions I--III,
deduction of Goedel's second incompleteness theorem. Another
view: consistency related to recursiveness.
None beyond SF level modules.
This module will be examined
in a 2-hour examination in Trinity term.
Fortnightly written assignments will count 10%, and
90% for the final.
Supplementals are normally not available in this module (except in the
case of JS TSM pattern A students).