Open Course Space

Logic II

Massachusetts Institute of TechnologyUnited States24.242
Free, no sign-up neededSpring 2004English
Go to course on MIT OpenCourseWare

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.

Description from MIT OpenCourseWare.

Where to take this course