| General Information | Schedule | Homework |
| Schedule |
|---|
| Class Number | Date | Reading | Brief Description |
|---|---|---|---|
| 1 | Monday, 1/23 | 1.1 - 1.3 | Introduction and Overview, Standard ML, Sets |
| 2 | Wednesday, 1/25 | 1.4 - 1.7 | Set Notation, Set Operations, ML Syntax and Types |
| 3 | Friday, 1/27 | 1.8 - 1.10 | Cardinality, Cartesian Products, Building Types |
| 4 | Monday, 1/30 | 1.11 - 1.13 | Defining Functions in ML |
| 5 | Wednesday, 2/1 | 2.1 - 2.3 | Lists, Functions on Lists |
| 6 | Friday, 2/3 | 2.1 - 2.3 | Implementing Sets in ML as Lists |
| 7 | Monday, 2/6 | 2.4 | Power Sets |
| 8 | Wednesday, 2/8 | 2.5, 6.1 | Option Types, Recursive Types |
| 9 | Friday, 2/10 | 3.1 - 3.4 | Propositional Formulas |
| 10 | Monday, 2/13 | 3.5, 3.7 | Coding Propositional Logic in ML, Logical Equivalence |
| 11 | Wednesday, 2/15 | 3.8 - 3.9 | Logical Implication, Arguments |
| 12 | Friday, 2/17 | - | First Exam |
| 13 | Monday, 2/20 | 3.10 - 3.13 | Predicates, Quantifiers |
| 14 | Wednesday, 2/22 | 3.12, 4.6 Notes |
Multiple Quantifiers, Evens and Odds |
| 15 | Friday, 2/24 | - | Evens and Odds, Proof Strategies, Proof by Contradiction |
| 16 | Monday, 2/27 | 4.1 - 4.2 | Contrapositives, Describing Sets, Subsets |
| 17 | Wednesday, 3/1 | 4.3 - 4.5, 4.7 - 4.8 Notes |
Subset and Set Equality Proofs |
| 18 | Friday, 3/3 | 5.1 - 5.3 | Relations, Image, Inverse, and Composition |
| 19 | Monday, 3/6 | 5.3 - 5.4 | Composition of Relations, Properties of Relations |
| 20 | Wednesday, 3/8 | 5.5 | Equivalence Relations |
| 21 | Friday, 3/10 | 7.1 - 7.3 | Functions |
| 22 | Monday, 3/13 | 7.4 - 7.5 | Images and Inverse Images of Functions |
| 23 | Wednesday, 3/15 | 7.6 | Injective and Surjective Functions |
| 24 | Friday, 3/17 | - | Second Exam |
| - | - | - | Spring Break |
| 25 | Monday, 4/3 | 7.7 - 7.8 | Inverse Functions, Function Composition |
| 26 | Wednesday, 4/5 | 6.2, 6.4 | Trees, Structural Induction |
| 27 | Friday, 4/7 | 6.4 - 6.5 | Structural Induction, Mathematical Induction |
| 28 | Monday, 4/10 | 6.5 - 6.6 Notes |
Induction, Strong Induction |
| 29 | Wednesday, 4/12 | 6.6 - 6.7 | Strong Induction, Recursive Functions |
| 30 | Friday, 4/14 | 6.7 | Creating and Justifying Recursive Functions |
| 31 | Monday, 4/17 | 4.10 | Integer Square Roots, The Euclidean Algorithm |
| 32 | Wednesday, 4/19 | 7.9 - 7.10 | Cardinality, Counting |
| 33 | Friday, 4/21 | 7.11 | Permutations and Combinations |
| 34 | Monday, 4/24 | - | Counting Problems |
| 35 | Wednesday, 4/26 | - | More Counting Problems, Generating Permutations |
| 36 | Friday, 4/28 | - | Properties of n choose k, Pascal's Triangle |
| 37 | Monday, 5/1 | - | Third Exam |
| 38 | Wednesday, 5/3 | 8.1 | The Binomial Theorem, Graphs and Directed Graphs |
| 39 | Friday, 5/5 | 8.1, 8.3 | Representing Graphs, Degrees, Walks and Paths |
| 40 | Monday, 5/8 | 8.6 | Depth-First Search and Breadth-First Search |
| 41 | Wednesday, 5/10 | 7.15 | Countable Sets |
| 42 | Friday, 5/12 | 7.15 | Uncountable Sets, Noncomputable Functions |