Correspondence by electronic mail. Fortunately, two of the larger equations (associativity of meet and x (y y ) = y y ) could be omitted, because they depend on the other axioms and lemmas; this allowed the search to run in less than 70 megabytes (1997)

by N Megill, Sept
Results 1 - 1 of 1

Automatic Proofs and Counterexamples for Some Ortholattice Identities

by William Mccune - Information Processing Letters , 1998
"... This note answers questions on whether three identities known to hold for orthomodular lattices are true also for ortholattices. One identity is shown to fail by MACE, a program that searches for counterexamples, an the other two are proved to hold by EQP, an equational theorem prover. The problems, ..."
Abstract - Cited by 21 (2 self) - Add to MetaCart
This note answers questions on whether three identities known to hold for orthomodular lattices are true also for ortholattices. One identity is shown to fail by MACE, a program that searches for counterexamples, an the other two are proved to hold by EQP, an equational theorem prover. The problems, from work in quantum logic, were given to us by Norman Megill. Keywords: Automatic theorem proving, ortholattice, quantum logic, theory of computation. 1 Introduction An ortholattice is an algebra with a binary operation (join) and a unary operation 0 (complement) satisfying the following (independent) set of identities. x y = (x 0 y 0 ) 0 (definition of meet) x y = y x (x y) z = x (y z) x (x y) = x x 00 = x x (y y 0 ) = y y 0 Supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, U.S. Department of Energy, under Contract W-31-109-Eng-38. From these identities one can...