| Lecture # | Date | Concepts | Reading | Slides |
| 1 | 8/25 (Mon) | Administrivia, introduction | - | [PDF] |
| 2 | 8/27 (Wed) | Propositional logic | 1.1 | [PDF] |
| 3 | 9/03 (Wed) | Applications of logic, logical equivalences | 1.1 - 1.2 | [PDF] |
| 4 | 9/08 (Mon) | Predicates and quantifiers | 1.3 | [PDF] |
| 5 | 9/10 (Wed) | More predicate logic, nested quantifiers | 1.3 - 1.4 | [PDF] |
| 6 | 9/15 (Mon) | Rules of inference, introduction to proofs | 1.5 - 1.6 | [PDF] |
| 7 | 9/17 (Wed) | Proof techniques | 1.7 | [PDF] |
| 8 | 9/22 (Mon) | Sets, set operations | 2.1 - 2.2 | [PDF] |
| 9 | 9/24 (Wed) | Set identities, functions | 2.2 - 2.3 | [PDF] |
| 10 | 9/29 (Mon) | Functions, summations | 2.3 - 2.4 | [PDF] |
| 11 | 10/01 (Wed) | Integers and division | 3.4 | [PDF] |
| 12 | 10/06 (Mon) | Primes, GCDs, representations | 3.5 - 3.6 | [PDF] |
| 13 | 10/08 (Wed) | Midterm review | - | - |
| 14 | 10/14 (Tues) | Midterm | - | - |
| 15 | 10/15 (Wed) | Mathematical induction | 4.1 | [PDF] |
| 16 | 10/20 (Mon) | Strong induction, recursive definitions | 4.1 - 4.2 | [PDF] |
| 17 | 10/22 (Wed) | Recursive definitions and structural induction | 4.3 | [PDF] |
| 18 | 10/27 (Mon) | Counting basics | 5.1 | [PDF] |
| 19 | 10/29 (Wed) | Counting basics, pigeonhole principle | 5.1 - 5.2 | [PDF] |
| 20 | 11/03 (Mon) | Permutations, combinations, binomial coefficients | 5.3 - 5.4 | [PDF] |
| 21 | 11/05 (Wed) | Generalized permutations and combinations | 5.5 | [PDF] |
| 22 | 11/10 (Mon) | Discrete probability, probability theory | 6.1 - 6.2 | [PDF] |
| 23 | 11/12 (Wed) | Probability theory | 6.2 | [PDF] |
| 24 | 11/17 (Mon) | Bayes theorem | 6.3 | [PDF] |
| 25 | 11/19 (Wed) | Expected value and variance | 6.4 | [PDF] |
| 26 | 11/24 (Mon) | Relations, n-ary relations | 8.1 - 8.2 | [PDF] |
| 27 | 12/01 (Mon) | Equivalence relations | 8.5 | [PDF] |
| 28 | 12/03 (Wed) | Final exam review | - | - |