MTH 350
Download as PDF
MTH 350 - Mathematical Logic (4 cr)
Course Title
Mathematical Logic
Catalog Description
The calculus of propositions. Existential and universal quantifiers. Turing machines and computability theory. Non-computable functions. The decision problem for arithmetic. Axiomatizing arithmetic. The Godel Incompleteness theorem.
Cross Listed Courses
Minimum
4
Max
4
Academic Progress Units
4
Requirement Designation
Regular Liberal Arts
Prerequisites & Corequisites
023460
Name
Lecture