Editing Equational prover

{{Short description|Software program}}
{{about|automated theorem proving|the complexity class named EQP|EQP (complexity)}}

{{Third-party|date=March 2024}}
'''EQP''' ('''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 algebra]]s are [[Boolean algebra (structure)|Boolean algebra]]s.

==References==
{{Reflist}}

==External links==
* [http://www.cs.unm.edu/~mccune/eqp/ EQP project].
* [http://www.cs.unm.edu/~mccune/papers/robbins/ Robbins Algebras Are Boolean].
* [https://web.archive.org/web/20030201112808/http://www-fp.mcs.anl.gov/division/welcome/default.asp Argonne National Laboratory, Mathematics and Computer Science Division].

[[Category:Theorem proving software systems]]