CS 4860

CS 4860

Course information provided by the Courses of Study 2014-2015.

Propositional and predicate logic, compactness and completeness by tableaux, natural deduction, and resolution. Equational logic. Herbrand Universes and unification. Rewrite rules and equational logic, Knuth-Bendix method, and the congruence-closure algorithm and lambda-calculus reduction strategies. Topics in Prolog, LISP, ML, or Nuprl. Applications to expert systems and program verification.

When Offered Spring.

Prerequisites/Corequisites Prerequisites: MATH 2210-MATH 2220, MATH 2230-MATH 2240, or MATH 1920 and MATH 2940; CS 2800 (or MATH 3320, MATH 3360, MATH 4320, MATH 4340, or MATH 4810); and some additional course in mathematics or theoretical computer science.

Distribution Category (MQR)

View Enrollment Information

Enrollment Information
Syllabi: none
  •   Combined with: MATH 4860

  • 4 Credits Stdnt Opt

  • 12540CS 4860  LEC 001