Mathematical Logic and Computability

Catalog description

Description: The basic metatheorems of first order logic: soundness, completeness, compactness, Löwenheim-Skolem theorem, undecidability of first order logic, Gödel's incompleteness theorem. Enumerability, diagonalization, formal systems, standard and nonstandard models, Gödel numberings, Turing machines, recursive functions, and evidence for Church's thesis. Same course as MATH 4003 . May not be used for degree credit with PHIL 5013 .