Software:EQP

From HandWiki
Revision as of 06:13, 9 November 2021 by imported>MedAI (update)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

EQP, an abbreviation for equational prover, is an automated theorem proving program for equational logic, developed by the Mathematics and Computer Science Division of the Argonne National Laboratory. It was one of the provers used for solving a longstanding problem posed by Herbert Robbins, namely, whether all Robbins algebras are Boolean algebras.

External links