MATH 4860 — Applied Logic
General Information
Topics chosen from propositional logic, first-order logic, and higher-order logic, both classical and intuitionistic versions, including completeness, incompleteness, and compactness results. Natural deduction and tableaux style logics and connection to the lambda calculus and programming languages and logics, and program verification. Other topics chosen from equational logic, Herbrand universes and unification, rewrite rules and Knuth-Bendix method, and the congruence-closure algorithm and lambda-calculus reduction strategies. Modal logics, intuitionistic logic, computational logics and programming languages (e.g., LISP, ML, or Nuprl). Students will be expected to be comfortable writing proofs.
Full Cornell course description (SP26)
Credits: 3
Prerequisites and Enrollment
Prerequisites: MATH 2210, MATH 2230, MATH 2310, MATH 2940, or equivalent.
Forbidden overlaps: CS 4860, MATH 4810, MATH 4860, PHIL 4310
Recorded Offerings
| Semester | Listed instructors | Course details |
|---|---|---|
| Spring 2026 | Anil Nerode | Roster / syllabus |
Workload and General Advice
Student contributions have not been added yet. Consult the offering’s syllabus for assignments and assessment details.
Student Experiences
No testimonials yet.
Course information checked against Cornell’s Spring and Fall 2026 rosters on September 18, 2026. The listed semesters are verified examples, not a complete offering history.