MATH 160BElementary Mathematical Logic II
A continuation of recursion theory, set theory, proof theory, model theory. Turing machines. Undecidability of arithmetic and predicate logic. Proof by induction and definition by recursion. Cardinal and ordinal numbers. Completeness and compactness theorems for propositional and predicate calculi.
Prerequisites
From the catalog: “MATH 160A or consent of instructor.”