Robbins algebra
Robbins algebra is a mathematical concept.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 19, 2026 · revision 2542248407
- What it is
- mathematical concept
- Named after
- Herbert Robbins
- Wikipedias with a page
- 3
Wikidata item Q7341067 (wikidata.org/wiki/Q7341067), public domain (CC0). Copied 2026-11-19.
What Wikipedia says · copied November 19, 2026 · revision 1326807918
In abstract algebra, a Robbins algebra is an algebra containing a single binary operation ∨ and a single unary operation ¬ that satisfy the following axioms:
For all elements a, b, and c:Associativity: a∨(b∨c)=(a∨b)∨c
Commutativity: a∨b=b∨a
Robbins equation: ¬(¬(a∨b)∨¬(a∨¬b))=a
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".
From the Wikipedia article “Robbins algebra” (en.wikipedia.org/wiki/Robbins_algebra), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.