Equational prover

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by InternetArchiveBot (talk | contribs) at 03:20, 3 December 2019 (Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This article is about automated theorem proving. For the complexity class named EQP, see EQP (complexity).

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Equational_prover&oldid=929015788"