Syllabus
Soundness and completeness of a calculus. Constructing formal proofs in the calculus HK.
Informal proofs. Provability and unprovability.
Contradictory and consistent theories. Methods for proving completeness, quantifier elimination.
Decidability. Recursive and recursively enumerable sets.
Prominent axiomatic theories. Proving undecidability of strong theories (that is, proving Gödel's first incompleteness theorem) using recursively enumerable sets.
Annotation
Advanced course in classical predicate logic; entry requirements are not formally defined.