The homepage for this course has moved to Stellar.

 

18.511: Introduction to Mathematical Logic
and Recursion theory (Fall 2007)

MeetingsMWF 1:00-2:00, 2-102
InstructorEric Rosen
Office2-279
Emailrosen (at) math (dot) mit (dot) edu
Description This course provides an introduction to mathematical logic. Topics to be covered include the syntax and semantics of first-order logic, formal proofs, the completeness and compactness theorems, basic model theory, Godel's Incompleteness Theorems, and elements of recursion theory, the study of computable functions.

Throughout the semester, we will also be considering the foundational role of logic with respect to basic questions about mathematics. For example, what is a mathematical proof? Are there mathematical claims that are true but not provable? (How) do we know that mathematics is not inconsistent? Can one formalize the notion of an algorithm?

TextMathematical Logic, by Ebbinghaus, Flum, and Thomas (Springer 1994)
Information about the book can be found on amazon.
Grading Homework (30%), two midterms (40%), final exam (30%)

Last updated May 29 2007