| Due Date | Problems |
|---|---|
| 4.3.2019. | Section 1.2 Problems 3, 4. |
| Section 2.1 Problems 1, 2, 7, 8, 9a | |
| 11.3.2019 | Section 3.3 Problems 2, 3, 8 |
| 20.3.2019 | Section 4.2 Problems 4, 6a |
| Section 4.3 Problems 2, 5 | |
| Section 4.4 Problems 6, 10 | |
| 25.3.2019 | Section 5.2 Problem 3 |
| Section 5.3 Problems 3, 4 | |
| Section 6.1 Problem 1a, 1b | |
| Give a bijection between (0,1) and [0,1] | |
| 1. 4. 2019 | Section 5.3 Problem 4e |
| Section 6.1 Problem 1c, 1d | |
| Prove that if f:A->B is surjective, then |B| <= |A|. | |
| 10. 4. 2019 | Prove the well-ordering principle: Every non-empty subset of the natural numbers has a first element. |
| Prove that the construction of the natural numbers as the cardinalities of all finite subsets of some infinite set H does not depend on the choice of H. |