Announcement: Graded PS7 are in the envelope next to my office.

Announcement: We will have a review session on Monday Dec 15 at 4:30, the room: 2-139.

Announcement: Further courses in logic at MIT.
In Spring 2009:

18.504 Seminar in Logic, Instructor: Mia Minnes.
Course Description: Algorithmic Randomness describes what it means for a string of bits to be random using notions from computability theory, information theory, and probability theory. The Kolmogorov Complexity of a string is its intrinsic information and is defined in terms of incompressibility. This seminar will explore these important notions and their applications. Possible topics for student projects include coding theory, learning theory, alternative notions of randomness, and entropy in physics. Students present and discuss the subject matter, and will have practice in written and oral communication.

18.575 Model Theory, Instructor: Cameron Freer.

Lecturer: Liat Kessler, kessler at math.mit.edu

Meetings: TR 9:30--11; 2-139

Office hours: T 2:00; 2-179, and by appointment

Midterm: November 4

Final Exam: Wednesday, December 17, 9:00AM - 12:00 NOON; 2-147

Homework: To be submitted in class on the day that it is due. Students are permitted to work together, but must write up solutions in their own words.

Grading: The course grade will be determined by the homework (35%), the midterm (25%), and the final exam (40%).

Syllabus (tentative)

Recommended texts: 

• Mathematical Logic: A Course with Exercises, Parts I and II, R. Cori and D. Lascar, Oxford University Press,   2000
• Mathematical Logic, Ebbinghaus, Flum, and Thomas, Springer,  1994