Description: Lecture, three hours. Requisites: courses 110A, 110B, 121, 131A, 131B. Naive, axiomatic set theory, axiom of choice and its equivalents, well-orderings, transfinite induction, ordinal and cardinal arithmetic. Applications to algebra: Hamel bases, Stone representation theorem. Applications to analysis and topology: Cantor/Bendixson theorem, counterexamples in measure theory, Borel and analytic sets, Choquet theorem.

Units: 4.0