Results 151 to 160 of about 672,721 (195)
Some of the next articles are maybe not open access.
1990
The paper On complemented lattices was the third paper in the new theory of orthomodular lattices which started in 1936 with Birkhoff and von Neumann’s idea of developing a new many-valued logic for quantum mechanics by using the lattice of closed subspaces C(H) of a Hilbert space H as the valuation lattice.
openaire +2 more sources
The paper On complemented lattices was the third paper in the new theory of orthomodular lattices which started in 1936 with Birkhoff and von Neumann’s idea of developing a new many-valued logic for quantum mechanics by using the lattice of closed subspaces C(H) of a Hilbert space H as the valuation lattice.
openaire +2 more sources
Decision problem for orthomodular lattices
Algebra Universalis, 1997The author partially solves the problem of H. P. Sankappanavar and S. Burris whether the theory of orthomodular lattices is recursively inseparable and which varieties of orthomodular lattices are finitely decidable. Results: -- The variety of orthomodular lattices has a finitely inseparable first order theory.
openaire +3 more sources
Decidability in Orthomodular Lattices
International Journal of Theoretical Physics, 2005We discuss the possibility of automatic simplification of formulas in orthomodular lattices. We describe the principles of a program which decides the validity of equalities and inequalities, as well as implications between them and other important relations significant in quantum mechanics.
Mirko Navara, Marek Hyčko
openaire +2 more sources
Boolean factors of orthomodular lattices [PDF]
Algebra Universalis, 1988 Bruns, Greechie, and Herman have shown that an orthomodular lattice whose commutator set is the commuting set of a finite set has to be a direct product of a Boolean algebra and a lattice without Boolean factor. The converse is refuted by a counterexample in this note.
openaire +1 more source
Block-Finite Orthomodular Lattices
Canadian Journal of Mathematics, 1979Introduction. Every orthomodular lattice (abbreviated : OML) is the union of its maximal Boolean subalgebras (blocks). The question thus arises how conversely Boolean algebras can be amalgamated in order to obtain an OML of which the given Boolean algebras are the blocks.
openaire +3 more sources
Projective orthomodular lattices II
Algebra Universalis, 1997The authors continue the study of projectivity in orthomodular lattices started in Part I [Can. Math. Bull. 37, No. 2, 145-153 (1994; Zbl 0819.06007)]. The main results: Theorem 1.1. No uncountable Boolean algebra is projective in the variety of all orthomodular lattices. Corollary 1.3. Every Boolean subalgebra of a free orthomodular lattice is at most
Micheale S. Roddy, Günter Bruns
openaire +2 more sources
Orthomodular Lattices in Occurrence Nets
2009In this paper, we study partially ordered structures associated to occurrence nets. An occurrence net is endowed with a symmetric, but in general non transitive, concurrency relation. By applying known techniques in lattice theory, from any such relation one can derive a closure operator, and then an orthocomplemented lattice.
BERNARDINELLO, LUCA +2 more
openaire +1 more source
Orthomodular Symmetric Lattices
1970Let J be an ideal of a lattice L, and assume that every element of J is modular. If x,y∈J and x ≦a ∨ y in L, then there exists an element u ∈ J such that x≦u ∨ y andu≦a.
Shûichirô Maeda, Fumitomo Maeda
openaire +2 more sources
The Structure Group of a Generalized Orthomodular Lattice
Studia Logica: An International Journal for Symbolic Logic, 2018W. Rump
semanticscholar +2 more sources
Remarks on Concrete Orthomodular Lattices
International Journal of Theoretical Physics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources