Logic, Set Theory, and Computability

Catalog description

This course studies Peano’s axioms for the natural numbers, induction principles, and recursive definitions. The topics in set theory include axiomatic set theory and the Cantor Bernstein theorem. The topics in logic are propositional logic and First-order logic. The section on computability covers formulation of the family of the computable functions and a discussion of the halting problem