Computer Science | Mathematical Logic I (MATH 585) (3 cr.)
585 | --


Students should register for MATH 585. P: MATH 351. Formal theories for
propositional and predicate  calculus with study of models,
completeness, compactness. Formalization of elementary number theory;
Turing  machines, halting problem, and the undecidability of arithmetic.