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: Spring 2011 on Storrs Campus
|5260||001||Lecture||MWF 11:00:00 AM-11:50:00 AM||MSB307||Solomon, Reed|