MATH 220CMathematical Logic
Mathematics · 4 units · Graduate courses (200-299)
Fundamental methods and results in mathematical logic, using mathematical methods to reason about existence or nonexistence of proofs and computations in many different settings. Topics include compactness theorem, saturation of models, completeness and incompleteness theorems of Gödel, Turing computability and degrees of unsolvability, recursion in Baire space, Zermelo/Fraenkel axioms, universe of constructible sets, and related equiconsistency results in set theory.
S/U or letter grading.
When it runs
- Spring 2026
- Spring 2027
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
Requisites
Official UCLA wording
Requisite: course M114S.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
MATH 220C
- MATH M114SIntroduction to Set Theory
- MATH 110AAlgebra
- MATH 115ALinear Algebra
- MATH 131AAnalysis
- PHILOS 135Introduction to Metalogic
- PHILOS 31Logic, First Course
- PHILOS 132Logic, Second Course
1 direct requisite. Showing 11 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
MATH 220C
- MATH 223STopics in Set Theory
1 course lists this as a requisite. The whole downstream is here — 1 course over 1 level. Every course here opens its own tree.