Short equational bases for ortholattices (2004)
| Venue: | Preprint ANL/MCS-P1087-0903, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL |
| Citations: | 2 - 2 self |
BibTeX
@TECHREPORT{Mccune04shortequational,
author = {W. Mccune and R. Padmanabhan and M. A. Rose and R. Veroff},
title = {Short equational bases for ortholattices},
institution = {Preprint ANL/MCS-P1087-0903, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Short single axioms for ortholattices, orthomodular lattices, and modular ortholattices are presented, all in terms of the Sheffer stroke. The ortholattice axiom is the shortest possible. Other equational bases in terms of the Sheffer stroke and in terms of join, meet, and complement are presented. Proofs are omitted but are available in an associated technical report. Computers were used extensively to find candidates, reject candidates, and search for proofs that candidates are single axioms. The notion of computer proof is addressed. 1
