Course goals
| Level | Standard |
|---|---|
| D | Execute an algorithm correctly in familiar situations. Identify a theorem or definition that is related. |
| C | Reproduce statements of definitions and theorems. Execute an algorithm correctly in novel situations. Use the algorithm as part of a solution to familiar types of problems. |
| B | Recognize situations where a definition or theorem does or does not apply. Appreciate subtleties and edge cases in definitions, theorems, and algorithms. Identify opportunities to use an algorithm. |
| A | Use multiple ideas in the same problem. Understand how an algorithm works. Transform problems into forms suitable for application of an algorithm or theorem. Appreciate relevance of concepts beyond specific course content. |
| Level | The implication relation |
|---|---|
| D | Recall the truth table of the implication relation. |
| C | Use and interpret the implication relation in mathematical statements. |
| B | Assess the validity of mathematical statements involving implication. Use relationships between implication and other mathematical concepts. |
| A | Write mathematical proofs involving implication. Recognize and discover relationships between implication and other mathemaitcal concepts. |
Weekly topics
| Weeks | Topics |
|---|---|
| 1–3 | Propositional logic, introduction and elimination rules, proof techniques and structure, sets |
| 4 | Functions, propositions as types, philosophy of introduction and elimination |
| 5–7 | Natural numbers, recursion, induction |
| 8 | Inequality, strong induction |
| 9 | Divisibility, remainder, begin math library project |
| 10–13 | Functions and relations; construction of Z and Q; modular arithmetic |
| 14 | Additional topics and/or review |