CSC 438S/2404S: Computability and Logic
Winter, 2014


Solutions to Problem Set 4 are posted below.

Click here for the 2008 final exam for CSC 438H/2404H.
(NOTE: The exam is a bit long -- this year's will be shorter.)

Chapter's I and II in Logical Foundations of Proof Complexity by Cook and Nguyen
(available on line through the U of T library) closely follows pp 1 - 52 in the Notes.

Accessibility Services requests a volunteer note-taker for this course.

Current background reading

Final Lecture Wednesday, April 2 (there will be a tutorial Friday)
We will present Godel's Incompleteness Theorems (notes pp 109 -- 112).

Lectures: MW 2 in BA 1220

Tutorial: F2 in BA 1220

Tutor: Bahar Aameri

Instructor: Stephen Cook , email: sacook@cs, Office: Sandford Fleming 2303C, 416-978-5183
Office Hours: MF 3:15 - 4:00 Or make an appointment, or drop in.

Text: None. See Lecture Notes below.

Marking Scheme:

Click here for the course information sheet

Reference Link: Handbook of Proof Theory, Chapters I and II by Sam Buss

Other References:

Computability Reference:
Michael Sipser: Introduction to the Theory of Computation .

Lecture Notes

Please send corrections and comments to the instructor.

Link to CSC 438/2404 2008 website

Problem Sets (.pdf files)

Tests (.ps files)