CSC 438F/2404F: Computability and Logic
Fall, 2016


Solutions to PS 4 are now posted below. Students did well: The average mark was 27.8/35. Seven students got perfect papers (out of 23 students total).

A good way to study for the final exam is to practice on previous final exams for the course.

The online course evaluation forms are now available -- PLEASE fill them out.

The online TA evaluations form is now available at []


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.

Lectures: MW 4 in SS 2106

Tutorial: F12 in SS 2106

Tutor: Lalla Mouatadid

Instructor: Stephen Cook , email: Office: Sandford Fleming 2303C, 416-978-5183
Office Hours: MW 5:15 - 6: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.

Problem Sets (.pdf files)

Tests (.pdf files)

Midterm Test
Solutions to Midterm Test
Marker's Comments

Click here for last year's CSC 438h, including problems sets and tests.