You are now in the main content area
MTH 714
Logic and Computability
Propositional and predicate calculus, first order theories, undecidability. Resolution and Horn clauses, logic programming (Prolog). Effective computability and halting problem. Applications of logic to problems in computability.
Weekly Contact: Lecture: 3 hrs. Tutorial: 1 hr.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1
Mentioned in the Following Calendar Pages
*List may not include courses that are on a common table shared between programs.
- Biology Core Elective Table III
- Biology Professional and Professionally-Related Elective Table III
- Biology Professional and Professionally-Related Table I
- Chemistry Professional and Professionally-Related Table I
- Computer Science Core Elective Table I
- Mathematics Core Elective Table I
- Minor in Mathematics
- PHL 650 - Beyond Classical Logic
