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. Lect: 3 hrs./Lab: 1 hr. Prerequisites: MTH 110 or MTH 314 Course Weight: 1.00 Billing Units: 1

There are no comments for this course.