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

Exclusions: MAT 309H, PHL 348H
Prerequisites for undergraduates: (CSC363H1/CSC463H1)/CSC365H1/CSC373H1/ CSC375H1/MAT247H1 (Send email to instructor if missing prerequisites)

Read Notes Incompleteness and Undecidablility

Solutions to PS 3 are posted below.

Finish Notes Computability Theory and start Notes Recursive and Recursively Enumerable Sets.


Lectures: MW 4 in MP 134

Tutorial: F12 in MP 134

Tutor: Robert Robere

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:

The work you submit must be your own. You may discuss problems with each other; however, you should prepare written solutions alone. Copying assignments is a serious academic offence and will be dealt with accordingly.

Click here for the course information sheet

Lecture Notes

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.

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 .

Problem Sets (.pdf files)

Tests (.pdf files)