Time Schedule:
Michael E. Townsend
PHIL 471
Seattle Campus
Study of the first-order predicate calculus with identity and function symbols. Consistency, soundness, completeness, compactness. Skolem-Lowenheim theorem. Formalized theories. Prerequisite: PHIL 470.
Class description
Introduction to some of the fundamental limitative results of twentieth-century mathematical logic, including the non-computability results of Church, Tarski, and Turing, as well as Gödel’s First and Second Incompleteness Theorems. Prerequisites: PHIL 470 or equivalent (that is, a basic understanding of proof by induction, definition by recursion, and first-order logic). Some familiarity with axiomatic set theory would be helpful, but is not considered a requirement. TEXTS: No Textbook Required.
Student learning goals
General method of instruction
Recommended preparation
Class assignments and grading
