RECENT POSTS
Eprover
May 26, 2018
Theorem prover for full first-order logic with equality
A saturating theorem prover for full first-order logic with equality. It accepts a problem specification, typically consisting of a number of first-order clauses or formulas, and a conjecture, again either in clausal or full first-order form. The system will then try to find a formal proof for the conjecture, assuming the axioms.
WWW http//www.eprover.org
- Older
- Newer