This list is being modified as the course progresses, but you can count on the entry for the next week being accurate.
Lecture notes, slides, and associated reading are hanging off the associated page. Just follow the link.
| Week | Topics | Reading |
|---|---|---|
| 1 | Course Introduction | CMU Chapters 1-2 |
| 1 | Propositional Calculus: Boolean Functions and Expressions | CMU Chapters 1-2 |
| 2 | Propositional Calculus: Boolean Algebra and Simplification | CMU Chapters 1-2 |
| 2 | Logic Design | Chapter 13 of FOCS |
| 3 | Natural Deduction | CMU Chapter 3 |
| 3 | Proof by Contradiction | CMU Chapter 4 |
| 4 | Proof Tactics, Strategies and Derived Rules | CMU Chapter 5 |
| 4 | Elementary MetaMathematics | CMU Chapter 6 |
| 5 | Satisfiability and SAT Solvers | none |
| 6 | Predicate Logic | CMU Chapters 7-9 |
| 7 | From ... to Induction | Chapter 2 of FOCS |
| 7 | Recursion and Induction | Chapter 2 of FOCS |
| 8 | Functional Programming in Racket | Litle Schemer (optional) |
| 8 | Recursion and List Processing | Little Schemer (optional) |
| 9 | Recursive Data Structures | Little Schemer (optional) |
| 9 | Proving Properties of Recursive List Functions | Little Prover |
| 10 | Proving Properties of Recursive Functions and Data Structures | Little Prover |
| 10 | Formalizing Inductive Proofs | Little Prover |