Logic II

This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel’s theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can recognize as true even though they don’t follow from the system of axioms. In my opinion, which is widely shared, this is the most important single result in t…

The syllabus, on MIT OpenCourseWare

The full course — syllabus, assigned readings, problem sets, exams, and lecture notes — lives on OCW. These open the real thing: