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

Journal of Algebra

Volumn 208, Issue 2, 1998, Pages 526-532

  Dahn, Bernd I ^a,b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b University of Koblenz   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042240318     PISSN: 00218693     EISSN: None     Source Type: Journal    
DOI: 10.1006/jabr.1998.7467     Document Type: Article

References (6)

1. S. Burris, An anthropomorphized version of the McCune's machine proof that Robbins algebras are Boolean, preprint.
2. B. Fitelson, Using Mathematica 3.0 to understand the computer proof of the Robbins conjecture, Math. Ed. Res. 7, No. 1, (1998).
3. E. V. Huntington, New sets of independent postulates for the algebra of logic, Trans. Amer. Math. Soc. 35 (1933), 274-304.
4. E. V. Huntington, Boolean algebra: A correction, Trans. Amer. Math. Soc. 35 (1933), 557-558.
5. W. McCune, Solution of the Robbins problem, J. Automat. Reason. 19(3) (1997), 263-276.
6. S. Winker, Absorption and idempotency criteria for a problem in near-Boolean algebras, J. Algebra 153(2) (1992), 414-423.