CSC 438/2404: Computability and Logic
Fall, 2007

Students should consult this page at least once a week for important information.

***Dec 3*** Extra office hours this week on Tuesday 10-11, and Wednesday 11-12 in SF 3207.

***Nov 30*** It is due Monday in tutorial. Question 4(b) asks you to show that Tarski's theorem as well as the Undecidability theorem follow from part 4(a). Since we did not cover the Undecidability theorem, you *only* have to show that Tarski's theorem follows from part 4(a). The other part (showing that Undecidability also follows) can be turned in for extra credit.

Lectures: Friday 9-11 LM 155, Tutorial Monday 10-11 LM 155

Instructor: Toniann Pitassi, email: toni@cs
Office: Sandford Fleming 2305A, 978-3695
Office Hours: Friday 11-12

Text: There is no required text for this course. A supplementary textbook that may be helpful is E. Mendelson: Introduction to Mathematical Logic, Wadsworth and Brooks/Cole, 1987.

Tutors: Phuong Nguyen

Course Information Sheet

HOMEWORK ASSIGNMENTS:

EXAMS:

OLD EXAMS:

COURSE NOTES:

SUPPLEMENTARY NOTES AND SLIDES FOR RESOLUTION:

SUPPLEMENTARY READING