MATH 220A

Mathematical Logic

Mathematics · 4 units · Graduate courses (200-299)

Open the requisite map View official UCLA course listing ↗Find on Bruinwalk ↗

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

Checking the Schedule of Classes…

Requisites

Official UCLA wording
Requisite: course M114S.

BruinTree reads · Prerequisite

confidence 1.00 · from text

MATH M114S

Requires

Everything that has to come before this course, not just the courses named in the requisite above.

MATH 220A

MATH M114SIntroduction to Set Theory
- MATH 110AAlgebra
  - MATH 115ALinear Algebra
- MATH 131AAnalysis
  - MATH 32BCalculus of Several Variables2 more beneath
  - MATH 33BDifferential Equations1 more beneath
- PHILOS 135Introduction to Metalogic

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 220A

MATH 223CTopics in Computability Theory
MATH 223DTopics in Descriptive Set Theory
MATH 223MTopics in Model Theory
MATH 223STopics in Set Theory

4 courses list this as a requisite. The whole downstream is here — 4 courses over 1 level. Every course here opens its own tree.