Encyclopedia > EQP

  Article Content

EQP

EQP, an abreviation for Equational Prover is an automated theorem proving program for first-order equational logic, developed by the Mathematics and Computer Science Division (http://www-fp.mcs.anl.gov/division/welcome/default.asp) of the Argonne National Laboratory and among other used for solving the problem proposed by Herbert Robbins[?] whether all Robbins algebras are Boolean, the problem arised from the Huntington's equation from 1933:

<math> n(n(x) + y) + n(n(x) + n(y)) = x \; . </math>

External links



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Michael Barrymore

... Barrymore, born 4 May 1952, is a British comedian famous for his variety shows. This article is a stub. You can help Wikipedia by fixing it. Ea ...

 
 
 
This page was created in 1139.3 ms