220A-220C. Mathematical Logic and Set Theory. Lecture, three hours. Requisite: course M112. Model theory: compactness theorem; Lowenheim/Skolem theorems; definability; ultraproducts; preservation theorems; interpolation theorems. Recursion function theory: thesis of Church; recursively enumerable sets; hierarchies; degrees. Formal proofs: completeness and incompleteness theorems; decidable and undecidable theories; quantifier elimination. Set theory: Zermelo/Fraenkel and von Neumann/Gödel axioms; cardinal and ordinal numbers; continuum hypothesis; constructible sets; independence results and forcing. S/U or letter grading.