MATH 469 - Introduction to Mathematical Logic

First order logic, focusing on Tarski’s formulation of Truth, Gödel’s Completeness Theorem, self-referential formulas, Gödel’s Incompleteness Theorem, Tarski’s theorem on the undefinability of Truth. Connections with computability theory, including Turing’s theorem on the unsolvability of the Halting Problem. Topics from model theory, including the Löwenheim-Skolem-Tarski theorems, the Compactness Theorem, and applications. Optional topics include the Cut-Elimination Theorem, ultraproducts, saturated models, methods for establishing decidability and completeness, and applications of priority arguments to degrees of unsolvability.

Prerequisite: MATH 451 - Algebraic Structures I with a grade of ‘C’ or higher.
Credit(s): 3
Course Attribute(s):

Honors Scholar Course.