Logic and Mathematical Inquiry,
Spring 2010

Instructor: Edward Dean	UPDATED Office Hours: M 1-2, W 1-2
Grader: Sebastian Stranahan

Official Course Description

Since ancient times, those searching for truth have looked to mathematical arguments as a paradigm of rational inquiry. We shall study the structure of these arguments and their application. In the first half of the course, we study the syntax and semantics of propositional and predicate logic while in the second, we apply this logic to examine axiomatic methods in set theory and arithmetic and introduce formal models of computation.

This course prepares students to take the 310-311 series on fundamental theorems in logic and computability theory.

• Here is a full syllabus, including course policies and an intended schedule.

Assignments

• Homework 1, due January 27.
• Homework 2, due February 3. (Sample solutions.)
• Homework 3, due February 10 12. (Sample solutions.)
• Homework 4, due March 3. (Sample solutions, plus a picture.)
• Homework 5, due March 17. (Sample solutions.)
• Homework 6, due March 26. (Sample solutions.)
• Homework 7, due April 7. (Sample solutions.)
• Homework 8, due April 14. (Sample solutions.)
• Homework 9, due April 21. (Sample solutions.)
• Homework 10, due April 30. (Sample solutions.)

Notes and Handouts

• Solutions to the first midterm.
• Here is a midsemester course survey. If you want to provide feedback on how you think the course is going so far, just fill this out and bring it in after spring break.
• A revised schedule for the course.
• March 26 lecture notes: Interpretations
• Solutions to the second midterm.
• April 19 - 28 lecture notes:Number theory from a logical point of view

Further Reading

Here can be found some readings beyond our required texts. All are optional, unless I specifically direct you otherwise in class. (Many will be password protected due to copyright concerns.)

• Gottlob Frege: On the scientific justification of a concept-script.
• Warren Goldfarb: Logic in the twenties: the nature of the quantifier.
• Alan Turing: Solvable and unsolvable problems.