21-400 Intermediate Logic

9 units, Carnegie Mellon University

The course builds on the proof theory and model theory of firstorder logic covered in 21300. These are applied in 21400 to Peano Arithmetic and its standard model, the natural numbers. The main results are the incompleteness, undefinability and undecidability theorems of Godel, Tarski, Church and others. Leading up to these, it is explained how logic is formalized within arithmetic, how this leads to the phenomenon of selfreference, and what it means for the axioms of a theory to be computably enumerable. Related aspects of computability theory are included to the extent that time permits. Three 50 minute lectures

Prerequisites: 21-300

Courseweave needs JavaScript to show sections, workloads and planning tools.