MATH 5026: Topics in Mathematical Logic
Description: Topics include, but are not restricted to, recursion theory (degree structures, hyperarithmetic hierarchy, applications to computable algebra, reverse mathematics), model theory (quantifier elimination, o-minimality, types, categoricity, indiscernible), set theory (ordinals, cardinals, Martin's axiom, constructible sets, forcing), and proof theory (deductive systems, cut elimination and applications, ordinal analysis). With a change of content, this course is repeatable to a maximum of twelve credits.
Prerequisites: MATH 5260.
MATH 5026 - Section 1: Computability Theory
Description: Computable functions, computably enumerable sets, the structure of the Turing degrees, basis theorems, the arithmetical hierarchy, finite injury priority arguments, forcing in arithmetic, minimal pairs and the computable ordinals.
Sections: Fall 2017 on Storrs Campus
|09541||5026||001||Lecture||MWF 11:15:00 AM-12:05:00 PM||MONT226||Eric Astor|