Robbins Conjecture

The conjecture that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom

 !(!(x v y) v !(x v !y))=x,

where !x denotes NOT and x v y denotes OR, imply those for a Boolean algebra. The conjecture was finally proven using a computer (McCune 1997).

See also

Boolean Algebra, Robbins Algebra, Robbins Axiom

Explore with Wolfram|Alpha


Kolata, G. "Computer Math Proof Shows Reasoning Power." New York Times, Dec. 10, 1996.McCune, W. "Solution of the Robbins Problem." J. Automat. Reason. 19, 263-276, 1997.McCune, W. "Robbins Algebras Are Boolean."

Referenced on Wolfram|Alpha

Robbins Conjecture

Cite this as:

Weisstein, Eric W. "Robbins Conjecture." From MathWorld--A Wolfram Web Resource.

Subject classifications