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
Quadratic formula

... "=", that will make it a perfect square trinomial of the form x2 + 2xy + y2. Since "2xy" in this case is (b/a)x, we must have y = b/(2a), so we add the square of b/(2a) ...

 
 
 
This page was created in 27.4 ms