| Monday | Wednesday | Friday | |
|---|---|---|---|
| Jan 9:
Prerequisites and preliminaries |
11: | 13
drop/add ends II.4 Polish notation |
|
| 16
ML King Day |
18
II.4 Polish notation, unique readability |
20
no class |
|
| 23
II.5 lexicon for predicate logic, formulas |
25
II.5 scope in formulas |
27
II.7 assignment of variables |
|
| 30
|
Feb 1
II.7: models |
3
(withdraw w/ 25% refund)
Exam 1: Chapters 0 and II.1-II.7 |
|
| 6
II.7-8 |= and |- |
8
II.8 intro compactness |
10
II.8 reduct, substructure |
|
| 13
II.8-9 propositional tautologies |
15
II.10: axioms, modus ponens |
17
Discuss exercise II.7.19, Lemma II.8.15 |
|
| 20
II.11: strategies for proof |
22
II.11: quantifier rules |
24
II.12: Herbrand model |
|
| 27
II.12: quotient structures, maximal consistent theories |
29
II.12: witnesses and maximal consistency |
Mar 2
11.12 Completeness Theorem |
|
| 5
Spring Break |
7
Spring Break |
9
Spring Break |
|
| 12
Review |
14
Exam 2 |
16
A Herbrand model of the rationals |
|
| 19
Introduction to computability |
21
Examples of finite automata |
23
Turing machine basics |
|
| 26
Turing machine examples |
28
computable and semicomputable |
30
universal machines, halting problem |
|
| Apr 2
5.3 recursive functions |
4
Recursive functions |
6
(Good Friday,
Passover begins Apr 7) Recursive relations, decidability |
|
| 9
decidability |
11
Godel numbering |
13
(drop by petition,
Passover ends April 14) Incompleteness theorem | |
| 16
Incompleteness again |
18
Review for Exam 3 |
20
Exam 3 |
|
| 23
Review |
25
Review |
27
reading/review |
|
| 30
|
May 3 (Thurs) 5:30-7:30 pm: Final | 4 |