Short equational bases for ortholattices: Web support. http://www.mcs.anl.gov/~mccune/papers/olsax (2003)

by W McCune, R Padmanabhan, M A Rose, R Veroff
Results 1 - 2 of 2

Automated discovery of single axioms for ortholattices

by W. Mccune, R. Padmanabhan, M. A. Rose, R. Veroff - Algebra Universalis , 2005
"... Abstract. We present short single axioms for ortholattices, orthomodular lattices, and modular ortholattices, all in terms of the Sheffer stroke. The ortholattice axiom is the shortest possible. We also give multiequation bases in terms of the Sheffer stroke and in terms of join, meet, and complemen ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract. We present short single axioms for ortholattices, orthomodular lattices, and modular ortholattices, all in terms of the Sheffer stroke. The ortholattice axiom is the shortest possible. We also give multiequation bases in terms of the Sheffer stroke and in terms of join, meet, and complementation. Proofs are omitted but are available in an associated technical report and on the Web. We used computers extensively to find candidates, reject candidates, and search for proofs that candidates are single axioms. 1.

Short equational bases for ortholattices

by W. Mccune, R. Padmanabhan, M. A. Rose, R. Veroff - Preprint ANL/MCS-P1087-0903, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL , 2004
"... 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. ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
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