MAT 341 Mathematical Logic I

Propositional logic, logic with quantifiers, and with equality. Proof techniques such as Hilbert systems, tableaus, and others. Models, and the extent to which the notion of model embodies and generalizes the various structures studied by mathematicians. Godel's Completeness Theorem, and consequences such as Compactness and Lowenheim-Skolem Theorems. The incompleteness results of Tarski, Godel, and others.

Credits:

3

Hours

3

Requirement Designation

Regular Liberal Arts

Offered

Fall-Spring