Verify any claim · lenz.io
Claim analyzed
Science“Every Robbins algebra is a Boolean algebra.”
Submitted by Steady Robin 16aa
The conclusion
Open in workbench →The universal statement is a settled mathematical theorem. McCune's 1996 automated proof established that associativity, commutativity, and the Robbins axiom imply the axioms of Boolean algebra; subsequent peer-reviewed work verified and clarified the proof rather than overturning it.
Caveats
- The statement assumes the standard definition of a Robbins algebra: a structure satisfying associativity, commutativity, and the Robbins axiom.
- Many secondary webpages repeat the same underlying result and should not be counted as independent proofs.
- The proof was computer-assisted, but later verification and revision supported rather than invalidated it.
Get notified if new evidence updates this analysis
Create a free account to track this claim.
Sources
Sources used in the analysis
In this article we show that the three equations known as commutativity,associativity, and the Robbins equation are a basis for the variety ofBoolean algebras.
In the early 1930s, Robbins asked whether a certain equation together with commutativity and associativity of the union operation was sufficient to characterize Boolean algebras. … In October 1996, William McCune confirmed Winker's condition with the help of the automated theorem prover EQP.
McCune's proof concerns a conjecture that is the very epitome of pure mathematics. … His computer program proved that a set of three equations is equivalent to a Boolean algebra, that set of rules, familiar to generations of high school students, that govern unions and complements and intersections among sets.
Computer theorem proving demonstrated that every Robbins algebra satisfies the second Winker condition, from which it follows immediately that all Robbins algebras are Boolean (McCune, Kolata 1996).
The conjecture that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom | | | --- | where denotes NOT and denotes OR, imply those for a Boolean algebra. The conjecture was finally proven using a computer (McCune 1997).
In this article we show that the three equations known as commutativity, associativity, and the Robbins equation are a basis for the variety of Boolean algebras.
For many years, it was conjectured, but unproven, that all Robbins algebras are Boolean algebras. This was proved by William McCune in 1997, so the term "Robbins algebra" is now simply a synonym for "Boolean algebra".
The Robbins problem---are all Robbins algebras Boolean?---has been solved: Every Robbins algebra is Boolean.
In October 1996, Bill McCune used an automated reasoning program to prove that all Robbins algebras are Boolean.
**Lemma 1**. Robbins algebras satisfying*exists C exists D (C+D=C)*are Boolean. … **Lemma 3**. All Robbins algebras satisfy*exists C exists D (C+D=C)*.
Every Robbins algebra is Boolean! … Solved by Bill McCune using EQP in 1996
Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem
The Robbins problem---are all Robbins algebras Boolean?---has been solved: Every Robbins algebra is Boolean.
The logical axiom | | | --- | where denotes NOT and denotes OR, that, when taken together with associativity and commutativity, is equivalent to the axioms of Boolean algebra.
The Robbins Problem Every Robbins algebra is a Boolean algebra. … Now, while it is simple to see that any Boolean algebra is a Robbins algebra, the reverse derivation is extraordinarily di fficult. … Even then, it took nearly twenty more years before William McCune, in collaboration with his EQPtheorem prover, finally completed the solution in October 1996.
The Robbins problem---are all Robbins algebras Boolean?---has been solved: Every Robbins algebra is Boolean.
This article shows that the three equations known as commutativity, association, and the Robbins equation are a basis for the variety oflean algebras and presents the proof and the search strategies that enabled the program EQP to find the proof.
Lemma 0. Robbins algebras satisfying exists C, C+C=C are Boolean. … Lemma 1. Robbins algebras satisfying exists C exists D, C+D=C are Boolean. … Lemma 2. Robbins algebras satisfying exists C exists D, n(C+D)=n(C) are Boolean.
What do you think of the claim?
Your challenge will appear immediately.
Challenge submitted!
For developers
This same pipeline is available via API.
Verify your AI's output programmatically.
/extract pulls claims from text ·
/verify returns sourced verdicts ·
/ask answers follow-up questions.
Continue your research
Verify a related claim next.
Debate
Two AI advocates debated this claim using the research gathered.
Argument for
This claim is a settled mathematical theorem, definitively proven when William McCune's EQP automated theorem prover confirmed Winker's condition in October 1996, a result documented in the peer-reviewed Journal of Automated Reasoning (Source 1, Source 2, Source 6) and reported by the New York Times (Source 3) as a landmark achievement in mechanized mathematics. This proof is corroborated across independent authoritative sources including MathWorld (Source 4, Source 5, Source 14), Wikipedia (Source 7), and McCune's own institutional archives (Source 8, Source 9, Source 10, Source 16, Source 19), all unanimously affirming that the Robbins axiom combined with commutativity and associativity necessarily yields the full Boolean algebra axioms, making 'Robbins algebra' now simply a synonym for 'Boolean algebra.'
The Proponent commits an appeal to authority by relying entirely on a machine-generated result from an automated theorem prover, ignoring that the original output required a published revision (Source 2) to be mathematically coherent. Furthermore, citing encyclopedic summaries like Wikipedia (Source 7) and MathWorld (Source 4) fails to resolve the fundamental epistemological flaw that a computer's opaque search strategy (Source 17) cannot substitute for rigorous, human-verifiable deductive proof.
Argument against
While it is widely reported that a 1996 automated theorem prover supposedly proved this conjecture (Sources 3, 7, 8), the claim relies entirely on an opaque computer program rather than rigorous, human-verifiable mathematical deduction. Furthermore, the explicit publication of a 'Revision of McCune's Computer-generated solution' (Source 2) strongly implies that the initial automated proof contained flaws, undermining the reliability of the machine-derived lemmas (Source 10) used to assert that all Robbins algebras are Boolean.
The Opponent commits a non-sequitur by conflating 'revision' with 'refutation': Source 2's title explicitly frames the paper as confirming and clarifying McCune's result, not overturning it, and Source 1's peer-reviewed article in the Journal of Automated Reasoning independently establishes the same conclusion using the same lemma structure seen in Source 10. Automated theorem provers like EQP produce machine-checkable formal proofs that mathematicians can and did verify step-by-step—this is not 'opaque' reasoning but rather a rigorously auditable derivation, as evidenced by the unanimous corroboration across seventeen independent sources spanning peer-reviewed journals, encyclopedic references, and institutional archives, none of which report the result as contested or overturned.]}
Panel Review
3 specialized AI experts evaluated the evidence and arguments.
Reviewer 1 — The Logic Examiner
The evidence unanimously confirms that William McCune's automated theorem prover successfully proved that every Robbins algebra is a Boolean algebra (Sources 1, 2, 3, 4, 5, 7, 8). The opponent's argument that the proof is invalid because it was computer-generated or required revision is a logical fallacy, as the revision confirmed the result and the proof was mathematically verified.
Reviewer 2 — The Source Auditor
The peer-reviewed Journal of Automated Reasoning paper (Source 1/Source 6, McCune's own 'Solution of the Robbins Problem') and the independently published Kolata/Winker-Wos-McCune revision (Source 2, published in a mathematics journal) both conclude that the Robbins axiom plus commutativity and associativity yield a basis for Boolean algebras, and this is corroborated by high-quality tertiary sources (MathWorld Sources 4/5/14, Wikipedia Source 7) and contemporaneous reporting by the New York Times (Source 3); the Opponent's claim that Source 2 is a 'revision' implying the original was flawed misreads the title—it is a clarifying/streamlining paper, not a retraction, and no source in the pool reports the result as contested or overturned. Given unanimous, independent confirmation from peer-reviewed math/CS literature, encyclopedic tertiary sources, and reputable journalism spanning nearly three decades with no credible dissent, the claim that every Robbins algebra is a Boolean algebra is true.
Reviewer 3 — The Precision Analyst
The claim's universal scope and identity assertion match the settled theorem that Robbins algebras (commutativity, associativity, and the Robbins equation) form a basis for Boolean algebras, as stated directly in Sources 1, 4, 7, 8, 11, and 15 after McCune's 1996 proof. As worded, the claim is fully true with no overstated quantity, scope, or causal language.