After successful completion of the course, students are able to explain and to judiciously apply the following concepts: propositional and predicate calculus, the proof calculus discussed in the lecture (in particular the role of the subsitution axiom as well as metatheorems such as introduction of quantifiers), semantic and syntactic consistency, compactness of propositional and first order predicate logic, unification algorithm and resolution  algorithm (and its compleness), ZFC axioms (in particular the role of AC), models and counterexamples to small fragments of ZFC, well orders and ordinal numbers. 

Propositional logic, first order predicate logic, completeness theorem; ZFC-Axioms; axiom of choice, cardinality; introduction to computational logic.

Lecture at the blackboard, supplemented by lecture notes. Moreover: Answers to students' questions.

First lecture: Oct 1, 2020.  

Oral exam