Cardinal arithmetic

Mathematics, Second Cycle
1 ali 2 year
first or second
slovenian, english
Course director:
Hours per week – 1. or 2. semester:
Content (Syllabus outline)

Sets and classes. Axioms of set theory. Axiom of choice, Zorn lemma and its applications, well ordering, transfinite induction, ordinal numbers and their arithmetic, Schröder-Bernstein theorem, cardinal numbers and their arithmetic. If time permits: filters and ultrafilters, large cardinal numbers.


W. Just, M. Weese: Discovering Modern Set Theory I. AMS, 1991.
P. R. Halmos: Naive set theory, Springer-Verlag, New York, 1974.
H. Ebbinghaus et al.: Numbers, Springer-Verlag, New York, 1990.
N. Prijatelj: Matematične strukture I, DMFA-založništvo, Ljubljana, 1996.

Objectives and competences

Improvement of knowledge of axiomatic set theory and acquaintance with the basics of ordinal and cardinal arithmetic.

Intended learning outcomes

Knowledge and understanding:
Understanding and application of axiomatic set theory and ordinal and cardinal arihtmetic.
Set theory is a fundamental branch of mathematics that provides the common language of mathematics. The Zorn lemma, ordinal and cardinal numbers are thus basic tools that find applications everywhere in mathematics. They are also interesting for philosophers.
Set theory provides a unifying approach to mathatics.
Transferable skills:
As no specific technical knowledge is necessary to follow the course, it is generally useful for development of mathematical technique and practice of mathematical thinking.

Learning and teaching methods

Lectures, exercises, homeworks, consultations


2 midterm exams instead of written exam, written exam
Oral exam
grading: 5 (fail), 6-10 (pass) (according to the Statute of UL)

Lecturer's references

Bojan Magajna:
MAGAJNA, Bojan. Infinitezimali. Obzornik za matematiko in fiziko, ISSN 0473-7466, 1983, let. 30, št. 2, str. 33-41. [COBISS-SI-ID 4773721]
MAGAJNA, Bojan. The minimal operator module of a Banach module. Proceedings of the Edinburgh Mathematical Society, ISSN 0013-0915, 1999, let. 42, št. 1, str. 191-208. [COBISS-SI-ID 8567641]
LE MERDY, Christian, MAGAJNA, Bojan. A factorization problem for normal completely bounded mappings. Journal of functional analysis, ISSN 0022-1236, 2001, vol. 181, no. 2, str. 313-345. [COBISS-SI-ID 10662489]
Marko Petkovšek:
PETKOVŠEK, Marko. Ambiguous numbers are dense. American mathematical monthly, ISSN 0002-9890, 1990, let. 97, št. 5, str. 408-411. [COBISS-SI-ID 8040537]
PETKOVŠEK, Marko, WILF, Herbert S., ZEILBERGER, Doron. A=B. Wellesley (Massachusetts): A. K. Peters, cop. 1996. VII, 212 str. ISBN 1-56881-063-6. [COBISS-SI-ID 4085337]
PETKOVŠEK, Marko. Letter graphs and well-quasi-order by induced subgraphs. Discrete Mathematics, ISSN 0012-365X. [Print ed.], 2002, vol. 244, no. 1-3, str. 375-388. [COBISS-SI-ID 11414873]
Andrej Bauer:
AWODEY, Steve, BAUER, Andrej. Propositions as [Types]. Journal of logic and computation, ISSN 0955-792X, 2004, vol. 14, no. 4, str. 447-471. [COBISS-SI-ID 13374809]
BAUER, Andrej, SIMPSON, Alex. Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability. Mathematical logic quarterly, ISSN 0942-5616, 2004, vol. 50, no. 4/5, str. 351-369. [COBISS-SI-ID 13378649]
BAUER, Andrej. A ralationship between equilogical spaces and Type Two Effectivity. Mathematical logic quarterly, ISSN 0942-5616, 2002, vol. 48, suppl. 1, str. 1-15. [COBISS-SI-ID 12033369]