Logic and Combinatorics
academic year 2024/25
Academic Coordinator: Vincenzo Dimonte
Period: Second semester
Duration: 28 hours
Program: This course serves as an introduction to infinite combinatorics, the quantitative study of infinite structures (e.g., sets, orders, trees, graphs). After an initial overview covering basic aspects of set theory, such as ordinals, cardinals, and the Axiom of Choice, the course will focus on classical results in infinite combinatorics, including:
- Sierpiński’s results on the Euclidean plane
- Erdős’s results on graphs
- Aronszajn’s results on trees
The course textbook is "Problems and Theorems in Classical Set Theory" by Péter Komjáth and Vilmos Totik.