Note: Readings are generally listed per week rather than per class.
| Date | Topic | Reading |
|---|---|---|
| Jan 18 | The Set Data Model | Sections 1.1 and 1.2 |
| Jan 20 | Proofs about Programs | |
| Jan 25 | General Induction | Sections 3.1 and 4.4 Section 3.3 (suggested) |
| Jan 27 | The Foundations of Induction | |
| Feb 1 | Adding Axioms to Models | Section 10.3 |
| Feb 3 | Propositional Logic | Sections 6.1, 6.2 |
| Feb 8 | More Propositional Logic | Section 6.3 (suggested) |
| Feb 10 | Predicate Logic | Sections 7.1, 7.2 |
| Feb 15 | Domain example: web data | |
| Feb 17 | Graphs and Relations | Section 1.3 |
| Feb 22 | Counting | Section 5.2 |
| Feb 24 | More Counting | |
| Feb 29 | Recurrence Relations | Section 5.3 |
| Mar 2 | More Recurrence Relations | |
| Mar 7 | Mid-term Recess | |
| Mar 9 | Mid-term Recess | |
| Mar 14 | Domain example: set-based analysis | |
| Mar 16 | More set-based analysis | |
| Mar 21 | Introduction to Prolog | |
| Mar 23 | More Prolog | |
| Mar 28 | Domain example: Databases | |
| Mar 30 | Spring Recess | |
| Apr 4 | Databases cont. | |
| Apr 6 | Databases cont. | |
| Apr 11 | Databases cont. | |
| Apr 13 | Finite state machines | |
| Apr 18 | Finite state machines: Modeling | |
| Apr 20 | Finite state machines: Closure Properties | |
| Apr 25 | Finite state machines: Minimization | |
| Apr 27 | Finite state machines: Implementing |