MATH 5260: Mathematical Logic I
Description: Predicate calculus, completeness theorem, compactness and applications, Lowenheim-Skolem theorems, formal theories with applications to algebra, Goedel's incompleteness theorems. Further topics chosen from: axiomatic set theory (ordinals, cardinals, infinite combinatorics, independence), model theory (quantifier elimination, types), recursion theory (reducibilities, degree structures, arithmetic hierarchy, Post's problem) or proof theory (deductive systems, cut elimination).
Prerequisites: MATH 5210.
Sections: Fall 2013 on Storrs Campus
|13291||5260||001||Lecture||TuTh 11:00 AM-12:15 PM||MSB307||Solomon, David|