CS 4860

CS 4860

Course information provided by the Courses of Study 2019-2020.

Propositional and predicate logic, compactness and completeness using tableaux, natural deduction, and/or resolution. Other topics chosen from the following: Equational logic. Herbrand Universes and unification. Rewrite rules and equational logic, Knuth-Bendix method, and the congruence-closure algorithm and lambda-calculus reduction strategies. Modal logics, intuitionistic logic, Prolog, LISP, ML, or Nuprl. Applications to expert systems and program verification. Noncomputability (Turing) and incompleteness (Gödel).

When Offered Spring.

Prerequisites/Corequisites Prerequisite: MATH 2210-MATH 2220, MATH 2230-MATH 2240, or MATH 1920 and MATH 2940; CS 2800 (or MATH 3320, MATH 3340 (formerly 4320), MATH 3360, or MATH 4340); and some additional course in mathematics or theoretical computer science.
Forbidden Overlaps Forbidden Overlap: due to an overlap in content, students will receive credit for only one course in the following group: CS 4860, MATH 4810, MATH 4860, PHIL 4310.

Distribution Category (MQR-AS)

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Combined with: MATH 4860

  • 4 Credits Stdnt Opt

  • 12785 CS 4860   LEC 001