Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem

DOI10.1006/jabr.1998.7467zbMath0919.06005OpenAlexW2050750962WikidataQ56039143 ScholiaQ56039143MaRDI QIDQ1273392

Bernd I. Dahn

Publication date: 9 March 1999

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jabr.1998.7467

zbMATH Keywords

Boolean algebraRobbins algebraRobbins equation

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05)

Related Items

Mechanizing complemented lattices within Mizar type system, Semi-intelligible Isar proofs from machine-generated proofs, Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors, Foundations for the Working Mathematician, and for Their Computer, Square Coloring Planar Graphs with Automatic Discharging, Mathematicians writing for mathematicians, An introduction to mechanized reasoning, Computer Solutions of Problems in Inverse Semigroups, On two alternative axiomatizations of lattices by McKenzie and Sholander

Uses Software

• Mathematica
• EQP

Cites Work

• Absorption and idempotency criteria for a problem in near-Boolean algebras
• Solution of the Robbins problem
• New Sets of Independent Postulates for the Algebra of Logic, With Special Reference to Whitehead and Russell's Principia Mathematica
• Boolean Algebra. A Correction