|
Robbins Algebras are Boolean

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.mcs.anl.gov/home/mccune/ar/robbins/ | |
|
|
|
| William McCune, Automated Deduction Group, Argonne National Laboratory | |
| The Robbins problem - are all Robbins algebras Boolean? - has been solved: Every Robbins algebra is Boolean. This theorem was proved automatically by EQP, a theorem proving program developed at Argonne National Laboratory. Information on the solution; a preprint of a paper on the topic that appears in the Journal of Automated Reasoning (JAR) (the JAR paper has simpler proofs than the ones on this page); input files and proofs corresponding to the JAR paper; and a press release. | |
|
|
|
| Levels: | College |
| Languages: | English |
| Resource Types: | Articles, Preprints, Documents/Sketches/Galleries, General Software Miscellaneous |
| Math Topics: | Logic/Foundations, Computer Science |
[Privacy Policy] [Terms of Use]


© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.