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


Problem Set 4 (Due beginning of lecture Monday Dec 7) now posted below.

Solutions to Problem Set 3 are posted below.

The midterm test, its solutions, and Marker's Comments are posted below.

Marker's comments on Problem Set 2 (as well as slightly revised Solutions to Problems Set 2) are posted below.

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 1085

Tutorial: F12 in SS 1085

Tutor: Robert Robere

Instructor: Stephen Cook , email: sacook@cs, 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 (.ps files)
Click here for last year's CSC 438/2404 web site (including problem sets and midterm test).