Eqp

EQP, an abbreviation for Equational Prover is an automated theorem-proving program for first-order equational logic, developed by the Mathematics and Computer Science Division 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:
n(n(x) + y) + n(n(x) + n(y)) = x \; .

External links

  • EQP project: http://www-unix.mcs.anl.gov/AR/eqp/
* Robbins Algebras Are Boolean: http://www-unix.mcs.anl.gov/~mccune/papers/robbins/

 

<< PreviousWord BrowserNext >>
chris smith
caetano veloso
sidney james webb, 1st baron passfield
sheep dog
gilberto gil
a study of history
cauvery river
aflatoxin
heitor villa lobos
arnold toynbee
lighting designer
elements of the philosophy of right
viktor frankl
meja
list of data structures
de arte alea
spectral line
ionisation
tabula
mars pathfinder
rebecca west
andrew sullivan
societalism
ourang medan
packard
human remains (1998 movie)
ren lvesque
elizabeth bishop
james wright (poet)
steve irwin
piper cherokee six
warhol worm
the man who fell to earth
anne sexton
kurmangazy
richard powers
disturbed
the sickness
believe
princess beatrice of york
am general
sesame street discography
bull riding
bronc riding