PHIL 106B — Mathematical Logic
[ hum sn ]We continue our rigorous investigation of logic that we began in Phil6A by studying the metatheory of formal systems. We begin with an introduction to sets, relations, and functions, after which we prove the Soundness, Completeness, and Löwenheim-Skolem Theorems for First-Order Logic. We end by examining Turing machines in order to introduce students to the notions of computability and undecidability, and to prepare them for the more advanced study of Gödel's Incompleteness Theorems. Usually offered every second year.