24.242Philosophy
Logic II
Prof. Vann McGee · Spring 2004 · Undergraduate
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…
Original on MIT OpenCourseWareStudent age
10years · 5th grade
Lectures
Looking up lectures on MIT OpenCourseWare…