Robbins algebra

In 1933, Edward Huntington proposed a new set of axioms for Boolean algebras, consisting of (1) and (2) above, plus:

• Huntington's equation: ${\displaystyle \neg (\neg a\lor b)\lor \neg (\neg a\lor \neg b)=a.}$ 

From these axioms, Huntington derived the usual axioms of Boolean algebra.

Very soon thereafter, Herbert Robbins posed the Robbins conjecture, namely that the Huntington equation could be replaced with what came to be called the Robbins equation, and the result would still be Boolean algebra. ${\displaystyle \lor }$  would interpret Boolean join and ${\displaystyle \neg }$  Boolean complement. Boolean meet and the constants 0 and 1 are easily defined from the Robbins algebra primitives. Pending verification of the conjecture, the system of Robbins was called "Robbins algebra."

Verifying the Robbins conjecture required proving Huntington's equation, or some other axiomatization of a Boolean algebra, as theorems of a Robbins algebra. Huntington, Robbins, Alfred Tarski, and others worked on the problem, but failed to find a proof or counterexample.

William McCune proved the conjecture in 1996, using the automated theorem prover EQP. For a complete proof of the Robbins conjecture in one consistent notation and following McCune closely, see Mann (2003). Dahn (1998) simplified McCune's machine proof.

• Algebraic structure
• Minimal axioms for Boolean algebra

• Dahn, B. I. (1998) Abstract to "Robbins Algebras Are Boolean: A Revision of McCune's Computer-Generated Solution of Robbins Problem," Journal of Algebra 208(2): 526–32.
• Mann, Allen (2003) "A Complete Proof of the Robbins Conjecture."
• William McCune, "Robbins Algebras Are Boolean," With links to proofs and other papers.