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
List of closed London Underground stations

... tube station[?] King William Street tube station[?] Lord's tube station[?] Mark Lane tube station[?] Marlborough Road tube station[?] North End tube station[?] ...

 
 
 
This page was created in 56.3 ms