Logic II
MIT OpenCourseWare's continuation of the Logic sequence covers computability theory and Kurt Godel's incompleteness theorems. The course builds from an introduction to computable functions toward a detailed proof of Godel's first incompleteness theorem, which shows that any consistent axiomatic system for arithmetic leaves some true statements unprovable within it. From there it covers related landmark results: Church's theorem on the undecidability of predicate calculus validity, Tarski's theorem on the undefinability of truth, and Godel's second incompleteness theorem on the impossibility of a system proving its own consistency. Materials include lecture notes, problem sets, and readings following MIT's standard OCW format for the course. No enrollment fee or certificate cost applies since this is a self-paced OpenCourseWare offering. The course assumes prior exposure to formal logic from an introductory course.