EQP

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. The problem arose from an equation given by Edward V. Huntington in 1933:

* $n(n(x)\; +\; y)\; +\; n(n(x)\; +\; n(y))\; =\; x\; ,.$

External links

* [http://www-unix.mcs.anl.gov/AR/eqp/ EQP project] .
* [http://www-unix.mcs.anl.gov/~mccune/papers/robbins/ Robbins Algebras Are Boolean] .
* [http://www-fp.mcs.anl.gov/division/welcome/default.asp Argonne National Laboratory, Mathematics and Computer Science Division] .