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: Recursion Theory
Description: Classical recursion theory. Topics include, but are not limited to: computable functions, recursively 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. Additional topics may be selected according to the interests
Sections: Spring 2015 on Storrs Campus
|08472||5026||001||Lecture||TuTh 9:30:00 AM-10:45:00 AM||MSB307||Linda Westrick|