Instructor: Foster Tom
Course on canvas.dartmouth.edu ⇗
Syllabus
| Date | Topic | Homework/Exams | Other notes |
| M Mar 30 | Introductions, introduction to set theory | ||
| W Apr 1 | Introduction to logic, proof writing (Part 1) | ||
| F Apr 3 | Logic, proof writing (Part 2) |
|
|
| M Apr 6 | Algebra of sets |
Homework 1: |
|
| W Apr 8 |
Ordered pairs |
||
| F Apr 10 | Functions, injective/surjective, left/right inverses | ||
| M Apr 13 | Axiom of choice, infinite Cartesian products |
Homework 2: |
|
| W Apr 15 | Equivalence relations, set partitions | ||
| F Apr 17 | Equivalence classes, well-definedness | ||
| M Apr 20 |
Midterm 1 Homework 3: |
||
| W Apr 22 | Natural numbers, inductive sets | ||
| F Apr 24 | Cardinality, countable sets | ||
| M Apr 27 | Countable union of countable sets, Cantor-Schroder-Bernstein theorem |
Homework 4: |
|
| W Apr 29 | Non-measurable sets | ||
| F May 1 | Cardinal arithmetic | ||
| M May 4 | Ordering cardinal numbers |
Homework 5: |
|
| W May 6 | Zorn's lemma | ||
| F May 8 | Zorn's lemma (part 2) | ||
| M May 11 |
Midterm 2 Homework 6: |
||
| W May 13 | Well-orderings | ||
| F May 15 | Transfinite recursion | ||
| M May 18 | Isomorphsisms of well-ordered structures |
Homework 7: Math19HW7.pdfDownload Math19HW7.pdf Math19HW7.texDownload Math19HW7.tex
|
|
| W May 20 | Ordinal arithmetic | ||
| F May 22 | Goodstein's theorem | ||
| M May 25 |
Homework 8: |
No class | |
| W May 27 | Construction of the Real Numbers | ||
| F May 29 | |||
| M June 1 |
Practice Final Exam: |
Last day of classes | |
| Su June 7 | Final exam at 8am |