OurBigBook About$ Donate
 Sign in Sign up

Ground resolution

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Mathematical logic Proof theory Resolution
2026-10-31  0 By others on same topic  0 Discussions Create my own version
The use of resolution on ground clauses. A finite refutation ends in the empty ground clause and establishes unsatisfiability of the chosen ground instances. Herbrand's theorem explains the completeness of searching for such refutations for universal equality-free first-order clauses.

 Ancestors (7)

  1. Resolution
  2. Proof theory
  3. Mathematical logic
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / a / C / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / b / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / c / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook