This schedule will be filled in as the semester progresses. Everything on the schedule (except exam dates and the due dates for the paper and the proposal) is tentative.
| date | topic | assignment |
| Wed, Jan 16 | Introduction to the course | none |
| Fri, Jan 18 | informal review of first-order logic; introduction to sets | Zalabardo 1.1-3 |
| Mon, Jan 21 |
NO CLASS |
Martin Luther King Day |
| Wed, Jan 23 | informal proofs | Zalabardo 1.4; do exercises 1.1 and 1.3 (you don't need to write out explanations for 1.3) |
| Fri, Jan 25 | relations | Zalabardo 1.5-6; do 1.6, 1.10 |
| Mon, Jan 28 | functions; numbers | Zalabardo, 1.7-8; do 1.24, 28, 34 |
| Wed, Jan 30 | formal languages and proof by induction | Zalabardo, 2.1-2.2; exercise: Zalabardo 1.44-46 |
| Fri, Feb 1 | propositional logic: syntax and semantics | Zalabardo, 2.3-4 (no homework problems 'til Monday) |
| Mon, Feb 4 | more on inductive proofs | Zalabardo, 2.5; |
| Wed, Feb 6 | unique readability theorem | read: Zalabardo 2.5, 2.6 do exercises 2.14, 2.15 |
| Fri, Feb 8 | review | do: exercises 2.26-30. (These should not be very hard proofs. You shouldn't
need to use induction on PL to prove them.) also: convince yourself that the claims in 2.17-19 are correct. You don't need to write out proofs, but if you have trouble convincing yourself of any of them, ask about it! |
| Mon, Feb 11 | first-order logic: syntax | read: Zalabardo 3.1-3.2 Turn in the proofs from last time (2.26-30). |
| Wed, Feb 13 | first-order logic: semantics I | read: Zalabardo 3.4-5 do: 3.14, 3.15. (For 3.15, you could use the definition of free variables on p. 88 as an indication of the kind of definition you need.) |
| Fri, Feb 15 | first-order semantics, continued | turn in 3.14, 3.15 (postponed from last time) |
| Mon, Feb 18 | review for first exam | |
| Wed, Feb 20 |
FIRST EXAM |
|
| Fri, Feb 22 | discussion of 3.19,3.20; den and truth functions | read: Zalabardo 3.6; do 3.19,3.20. Suggestion for 3.20: take the universe to be the set of natural numbers. (also: think about how to prove 3.17, but you don't need to write it out) |
| Mon, Feb 25 | first-order semantics, continued: computational implementations of den and truth functions | |
| Wed, Feb 27 | FO semantics, concluded: logical consequence, logical truth, logical equivalence, satisfiability; models | |
| Fri, Feb 29 | FO logic: deduction I (propositional rules; substitution) | Zalabardo 4.1-4 |
| Mon, March 3 | FO logic: deduction III (def. of deducibility) | Zalabardo 4.5-4.7 |
| Wed, March 5 | soundness | Zalabardo 5.1 |
| Fri, March 7 | completeness I | Zalabardo 5.2-5.5 |
| Mon, March 10 | No class (instructor has jury duty) | |
| Wed, March 12 | completeness II | Zalabardo, rest of chapter 5 |
| Fri, March 14 | Compactness; Lowenheim-Skolem Theorem | paper/project proposal due |
| Mon, March 17 - Fri, March 21 |
NO CLASS |
Spring Break |
| Mon, March 24 | Smith, chapters 1-2 | |
| Wed, March 26 | S, chapter 3 | |
| Fri, March 28 | S, chapter 4 | |
| Mon, March 31 | S, chapter 5 (take 1) | |
| Wed, April 2 | S, chapter 5-7 | |
| Fri, April 4 | review for second exam | |
| Mon, April 7 |
SECOND EXAM |
|
| Wed, April 9 | 8 | |
| Fri, April 11 | 9 | |
| Mon, April 14 | no class | |
| Wed, April 16 | 10 | |
| Fri, April 18 | primitive recursive functions | 11 |
| Mon, April 21 | 12 | |
| Wed, April 23 | 13 | |
| Fri, April 25 | 14-15 | |
| Mon, April 28 | 16 paper due | |
| Wed, April 30 |
17-18 | |
| Fri, May 2 | review for final | |
|
FINAL EXAM (2:00 PM) |
|
Last update: April 21, 2008. |