MATH 223C

Topics in Computability Theory

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

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

Degrees of unsolvability, recursively enumerable sets, undecidable theories; inductive definitions, admissible sets and ordinals; recursion in higher types; recursion and complexity. Topics vary from year to year. May be repeated for credit with consent of instructor.

S/U or letter grading.

When it runs

Not on the schedule for any of Fall 2025 through Spring 2027. UCLA publishes only that window, so this does not mean the course is gone — check the official listing.

Checking the Schedule of Classes…

Requisites

Official UCLA wording
Requisites: courses 220A, 220B.

BruinTree reads · Prerequisite

confidence 1.00 · from text

all of

Requires

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

MATH 223C

MATH 220AMathematical Logic
- MATH M114SIntroduction to Set Theory
  - MATH 110AAlgebra1 more beneath
  - MATH 131AAnalysis2 more beneath
  - PHILOS 135Introduction to Metalogic4 more beneath
MATH 220B

2 direct requisites. Showing 7 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.

No course in the catalog lists this as a requisite.