This course will be taught from Boolos, Burgess, and Jeffrey, Computability and Logic

The readings and topics we will cover are (in order) the following:

Chapter 1 - enumerability
Chapter 2 - uncountability
Chapter 9 - syntax of first-order logic
Chapter 10 - semantics of first-order logic
Handout on deduction
Chapter 6 - primitive recursive functions
Chapter 7 - recursive functions and relations
Chapter 15 - computability and logic
Chapter 16 - representation of recursive functions in logic
Chapter 17 - the first incompleteness theorem

Homework:

For Monday, August 29: Exercise 1.3
For Wednesday, September 7: Exercises 2.8 and 2.9
For Monday, September 19: Exercise 9.5
For Monday, September 26: Exercise 10.6
For Monday, October 3: The Negation Theorem, 3.2.4 in the updated handout (p. 15)
For Monday, October 10: nothing
For Monday, October 17: Exercise 6.5 (not graded - just for evaluation)
For Monday, October 24: Exercises 7.5 and 7.6
For Monday, October 31: Exercise 15.5
For Monday, November 7: nothing
For Monday, November 14: Exercise 16.17
For Monday, November 21: Exercise 16.16
For Monday, November 28: nothing

Sample solutions to exercises.