MATH 4000, 5000
Prof. Monk
Fall 2014

Course notes
1. Sentential logic
2. Fundamentals of first-order logic
3. Proofs
4. The completeness theorem
5. Peano arithmetic and Goedels incompleteness theorem
6. Representablity of recursive functions
7. Recursive functions
8. Recursiveness of syntactic notions
Index of symbols
Index of words
Errata 1: proof of Proposition 3.40
Errata 2: Lemmas 4.21, 4.22
Review questions for midterm 2
Solutions for review questions for midterm 2
New proofs of 4.29 and 4.30
New proof of Proposition 5.2
Review questions for the final, revised on Nov. 24
Solutions for review questions for the final

Assignments
#1, due Friday September 5: E1.1, E1.3, E1.7, E1.10; for math 5000 students: in addition, E1.5
#2, due Friday September 12: E1.9, E1.11, E1.12, E1.14; for math 5000 students: in addition, E1.15
#3, due Friday September 19: E2.1, E2.2, E2.3, E2.4; for math 5000 students: in addition, E2.8.
#4, due Friday September 26: E2.5, E2.6, E2.10, E2.11; for math 5000 students: in addition, E2.16 and E2.17.
#5, due Friday October 10: E3.2, E3.3, E3.5, E3.7; for math 5000 students: in addition, E3.6.
#6, due Friday October 17: E3.8, E3.9, E3.12, E3.19; for math 5000 students: in addition, E3.11.
#7, due Friday October 24: E4.2, E4.3, E4.4, E4.5; for math 5000 students: in addition, E4.7.
#8, due Friday October 31: E4.8, E4.9, E4.10, E4.11; for math 5000 students: in addition, E4.12.
#9, due Friday December 5: E5.1, E5.2, E5.3, E5.4; for math 5000 students: in addition, E5.8, E5.9, E5.10.

Solutions
Assignment 1
Assignment 2
Assignments 3,4
Test 1
Assignment 5
Assignment 6
Assignment 7
Assignment 8
Test 2
Assignment 9