SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Set Theory - NAIL063
Title in English: Teorie množin
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018 to 2018
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:2/0 Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Additional information:
Guarantor: Mgr. Jan Kynčl, Ph.D.
doc. Mgr. Robert Šámal, Ph.D.
Class: Informatika Bc.
Classification: Informatics > Theoretical Computer Science
Incompatibility : NLTM030
Annotation -
Last update: G_I (28.05.2004)
An introductory course to set theory.
Aim of the course - Czech
Last update: T_KTI (26.05.2008)

Naučit základy teorie množin

Literature - Czech
Last update: doc. Mgr. Robert Šámal, Ph.D. (02.03.2017)
  • B. Balcar, P. Štěpánek, Teorie množin, Academia, Praha 1986
  • K. Kunen, Set Theory, North Holland 1980
  • B. Balcar, P. Štěpánek, Teorie množin, skriptum MFF UK, Praha 1974, 1980
  • Paul R. Halmos: Naive Set Theory, Springer 1998/Martino Fine Books 2011 (reprint, orig. ed. 1960)
  • Karel Hrbacek, Thomas Jech: Introduction to Set Theory, 3.ed., Marcel Dekker, 1999
  • Raymond M. Smullyan: Set Theory and the Continuum Problem, Dover Books on Mathematics, 2010

Requirements to the exam -
Last update: Mgr. Jan Kynčl, Ph.D. (14.02.2019)

For the English class, the exam will be written based on the material that was presented.

Syllabus -
Last update: doc. Mgr. Robert Šámal, Ph.D. (21.02.2018)

1. Historical background, axioms of ZFC.

2. Basic operations: inclusion, intersection, difference, pairs, cartesian product, relation, function.

3. Ordering, well-ordering, ordinal numbers, natural numbers, basics from ordinal arithmetic.

4. Countable and uncountable sets, cardinal numbers, Cantor-Bernstein theorem, cardinal arithmetics.

5. Classes and relations, transfinite induction and recursion.

6. Axiom of choice and its equivalents.

7. Elements of infinitary combinatorics: Konig's lemma, Compactness principle, Ramsey theorem.

For details see

Charles University | Information system of Charles University |