6 EC
Semester 2, period 4, 5
5122AXVE6Y
Axioms of Set Theory, Set Theory as a Foundations of Mathematics, Ordinal Numbers, Cardinal Numbers, Axiom of Choice, Axiom of Foundation. Cardinal and ordinal arithmetic. Basics of some additional topics such as large cardinals, constructible universe and the consistency of Continuum Hypothesis, absoluteness, non-wellfounded sets and the Anti-Foundation Axiom.
K. Hrbacek and T. Jech, Introduction to Set Theory, Third Edition, Revised and Expanded, CRC Press, 1999.
The course is taught in English.
|
Activiteit |
Aantal uur |
|
Hoorcollege |
30 |
|
Tentamen |
3 |
|
Werkcollege |
26 |
|
Zelfstudie |
109 |
Programme's requirements concerning attendance (OER-B):
| Item and weight | Details |
|
Final grade | |
|
1 (100%) Deeltoets |
The deadlines for homeworks are strict, no delays are allowed.
The 'Regulations governing fraud and plagiarism for UvA students' applies to this course. This will be monitored carefully. Upon suspicion of fraud or plagiarism the Examinations Board of the programme will be informed. For the 'Regulations governing fraud and plagiarism for UvA students' see: www.student.uva.nl
| Weeknummer | Onderwerpen | Studiestof |
| 1 | History of Set Theory | |
| 2 | More History. Naive Set Theory. Paradoxes | |
| 3 | Naive Set Theory Continued. Axioms of ZFC. | |
| 4 | More ZFC. Classes. Ordinals. | |
| 5 | Recursion on ordinals. Axiom of Choice (AC) and Well-Ordering Theorem | |
| 6 | Ordinal Arithmetic. | |
| 7 | Continuous Functions, Fixed Point Theorem, Normal Forms. Applications. | |
| 8 | Cardinal Arithmetic. Schroder-Bernstein Theorem. | |
| 9 | Cardinal Exponentiation. Generalized Continuum Hypothesis (GCH). | |
| 10 | Large Cardinals: Inaccessible cardinals and Models of Set Theory. | |
| 11 | Review Other Topics: Boolean algebras, topologies, measure algebras. | |
| 12 | Trees, Konig Tree Lemma. Applications to Large Cardinals. | |
| 13 | Godel's Constructible Universe. Absoluteness. Montague-Levy Reflection Theorem. | |
| 14 | First Order Universes, and the (relative) consistency of AC. | |
| 15 | Tarski-Vaught Theorem, MSTV Theorem and the (relative) consistency of GCH. | |
| 16 | The Ideas behind the Independence Proofs for AC and GCH. Review. |
The schedule for this course is published on DataNose.
There is no honors extension for this course.
Recommended prior knowledge: Mathematical maturity, decent understanding of first-order logic.