SET THEORY

MATH 770

First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.

MATH 570

Introduces the basic concepts of Set Theory including: Set-theoretical paradoxes and means of avoiding them, sets, relations, functions, orders and well-orders, proof by transfinite induction and definitions by transfinite recursion, cardinal and ordinal numbers and their arithmetic, construction of the real numbers, the axiom of choice and its consequences.

MATH 776

Review of compactness and some consequences. Quantifier elimination with examples. The omitting types theorem. Categoricity. Baldwin-Lachlan theory. Strongly minimal and o-minimal theories. Saturated models. Morley's theorem. Familiarity with the topics in a basic Foundations course such asMATH 770is strongly recommended.

MATH 773

Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals. Familiarity with the topics in a basic Foundations course such asMATH 770is strongly recommended.

MATH 975

Selected topics in Mathematical Logic.