Date
| Homework
| Reading
| Subject
|
Sep 01 |
|
|
Intro, syllabus, textbook, policies |
Sep 03 |
|
1.0-1.1 |
A formal language; translation |
Sep 08 |
|
1.2 |
truth assignments |
Sep 10 |
HW1 |
|
proofs in the language; strategies |
Sep 11 |
Last day to add classes |
|
Sep 15 |
|
1.3 |
parsing a wff |
Sep 17 |
|
1.4 |
induction and recursion |
Sep 22 |
|
|
proofs about the language; soundness of proof
system |
Sep 24 |
|
1.5 |
connectives |
Sep 25 |
Last day to drop classes, change grading option, switch
sections, add independent study |
Sep 29 |
HW1 due;
HW2 |
1.6 |
circuits |
Oct 01 |
|
1.7 |
compactness |
Oct 06 |
|
|
completeness |
Oct 08 |
|
1.7 |
effectiveness, enumerability, decidability, etc. |
Oct 13 |
|
2.0-2.1 |
A larger formal language; translation |
Oct 15 |
|
2.2 |
truth in a model |
Oct 20 |
HW2 due |
2.2-2.3 |
truth in a model |
Oct 22 |
|
2.4 |
proofs in the language |
Oct 27 |
Research day: no classes |
Oct 29 |
HW3 |
2.4 |
proofs in the language |
Oct 30 |
Last day to withdraw from classes |
|
Nov 03 |
HW1 resubmissions due |
2.5 |
soundness and completeness; compactness |
Nov 05 |
|
2.5 |
soundness and completeness; compactness |
Nov 10 |
HW3 due |
2.6 |
models of theories |
Nov 12 |
HW4 |
2.6 |
models of theories |
Nov 17 |
|
3.0-3.1 |
natural number arithmetic |
Nov 19 |
|
3.3 |
finitely axiomatizable arithmetic |
Nov 24 |
|
3.3 |
finitely axiomatizable arithmetic |
Nov 26 |
Thanksgiving: no classes |
|
Dec 01 |
|
3.4 |
Gödel numbering |
Dec 03 |
HW4 due; HW5 |
3.5 |
Incompleteness and undecidability |
Dec 08 |
|
3.6 |
Recursive functions |
Dec 10 |
|
|
catch up and review |
Dec 15 |
HW5 due |
final exam period, 1:00-3:00 |
|