The course assumes knowledge of Gödel's Completeness and Incompleteness Theorems for predicate (i.e. first order) logic. Also knowledge of basic naive and axiomatic set theory is needed.
Lectures
Weeks 3-9 and 11-18 Tuesday 14-16 in room C124. No lecture on 22. March.
Easter holiday 21.-27.4.
Content outline
Lecture notes In SO7, page 8, proof of the theorem: In the definition of R the implication arrow has to be reversed. Then the proof works.
Steward Shapiro, Foundations without Foundationalism, (Clarendon press, Oxford 1991/2000).
Daniel Leivant, Higher order logic, in: Handbook of Logic in Artificial Intelligence and Logic Programming: Deduction methodologies Dov M. Gabbay, Christopher John Hogger, John Alan Robinson (eds.) Oxford University Press, 1994.