Fall, 2016

** Announcements **

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 https://www.teach.cs.toronto.edu/taeval/ [www.teach.cs.toronto.edu]

=====================================

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: sacook@cs.toronto.edu
Office: Sandford Fleming 2303C, 416-978-5183

Office Hours: MW 5:15 - 6:00
Or make an appointment, or drop in.

QUESTIONS VIA EMAIL ARE WELCOME.

** Text: ** None. See Lecture Notes below.

** Marking Scheme: **

- 4 assignments worth 10% each (Due at beginning of tutorial Sept 30, Oct 21, Nov 18, Monday Lecture Dec 5.)
- 1 closed-book test worth 20%: Oct 28
- final exam worth 40%

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

** Other References: **

- Herbert Enderton:
**A Mathematical Introduction to Logic**. Academic Press, 1972. - E. Mendelson:
**Introduction to Mathematical Logic**. Wadsworth & Brooks/Cole, 1987 - Pavel Pudlak:
**Logical Foundations of Mathematics and Computational Complexity**`A Gentle Introduction.'

This is full of interesting historical notes and philosophical comments.

Michael Sipser:

** Lecture Notes **

Please send corrections and comments to the instructor.

- Notes pp1-18: Propositional Calculus (slightly revised)
- Notes pp18-30: Predicate Calculus (page 21, 3) clarified
- Notes pp31-38: Completeness of LK
- Notes pp39-53: Herbrand Theorem, Equality and Compactness
- Notes pp54-70: Computability Theory
- Notes pp71-82: Recursive and Recursively Enumerable Sets
- Notes pp83-95: Incompleteness and Undecidability Part I.
- Notes pp96-108: Peano Arithmetic
- Notes pp109-112: Godel's Incompleteness Theorems

** Problem Sets ** (.pdf files)

- Problem Set 1
- Solutions to Problem Set 1
- Markers comments on Problem Set 1
- Problem Set 2
- Solutions to Problem Set 2
- Problem Set 3
- Solutions to Problem Set 3
- Problem Set 4
- Solutions to Problem Set 4

Midterm Test

Solutions to Midterm Test

Marker's Comments

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