Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2004.01962 · Journal of Logic and Computation

Sublattices and Δ-blocks of orthomodular posets

Ivan Chajda, Helmut Länger

Published Jun 25, 2020• 0 citations
arXivHTMLPDF

Abstract

Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation $\mathrel \Delta$ and a binary operator $d(x,y)$ that are generalizations of the binary relation $\textrm{C}$ and the commutator $c(x,y)$, respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations $\mathrel \Delta$ and $\leftrightarrow$ (the latter was introduced by P. Pták and S. Pulmannová) and the operator $d(x,y)$. In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of $\Delta$-blocks with respect to Boolean subalgebras and distributive subposets they include.

DOI
10.1093/logcom/exaa037

Related papers

Subalgebras of orthomodular lattices

John Harding, Mirko Navara

Sachs showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham, at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.

arXiv:1009.4433•Sep 22, 2010•0 citations

Systems of quantum logic

R I G Hughes

According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.

•Jan 1, 2010•0 citations

From orthoposets to orthomodular posets

John Harding, Gejza Jenda, Bert Lindenhovius

We show that the category of orthomodular posets is a full coreflective subcategory of the category of strong orthoposets, those orthoposets in which any two orthogonal elements have a join. This coreflection is obtained by building from a strong orthoposet $P$, an orthomodular poset with the same underlying set and same orthocomplementation as $P$, but with modified order. This coreflector restricts to a functor from the category of ortholattices to the category of orthomodular posets, and this functor is right adjoint.

math.COCross-listedarXiv:2607.01259•Jun 10, 2026

Reconstructing an atomic orthomodular lattice from the poset of its Boolean sublattices

Carmen Constantin, Doering, Andreas

We show that an atomic orthomodular lattice L can be reconstructed up to isomorphism from the poset B(L) of Boolean subalgebras of L. A motivation comes from quantum theory and the so-called topos approach, where one considers the poset of Boolean sublattices of L=P(H), the projection lattice of the algebra B(H) of bounded operators on Hilbert space.

arXiv:1306.1950•Jun 8, 2013•1 citation

Algebraic computations in quantum logics

Jeannine J. M. Gabriëls

Mathematical description of quantum phenomena requires an event structure more general than a Boolean algebra. For this purpose, Birkhoff and von Neumann proposed the notion of an orthomodular lattice. Its typical feature is the existence of so–called non–commuting events, which are not simultaneously observable (like position and momentum, according to Heisenberg’s uncertainty principle). There is an old open problem whether the word problem for orthomodular lattices is solvable. Is it possible to decide whether two formulas are equivalent? In Boolean algebras, an easy positive answer is given by a transformation of the formula to a unique normal form. This requires the commutativity, associativity, and distributivity of the Boolean operations (disjunction and conjunction). In orthomodular lattices, the corresponding lattice operations (join and meet) violate distributivity. This disables the use of normal forms. We looked for alternative approaches. E.g., the join is only one of six orthomodular lattice operations generalizing the disjunction. In the thesis, we study the question whether some of the 96 binary operations in orthomodular lattices admit normal forms similar to the classical logic. The first question was which operations satisfy the associative identity, eventually under the assumption that some variables commute. Then we studied monotonicity because it is related to distributivity over the meet and join. The conclusion is that there is no pair of operations in orthomodular lattices admitting “Boolean–like” normal forms. In the last chapter we study “Moufang–like” identities, which were inspired by the algebras of quaternions and octonions. These identities generalize associativity and may enable further progress. As a by–product, we proved interesting, yet unknown, properties of some orthomodular lattice operations (e.g., the Sasaki projection). These new tools simplify algebraic computations and give a chance to develop algorithms more general than the current specialized software.

•Jan 1, 2015•0 citations

On orthoposets of numerical events in quantum logic

Dietmar Dorninger, Helmut Länger

Let S be a set of states of a physical system and p(s) the probability of the occurrence of an event when the system is in state s in S. Such a function p from S to [0,1] is known as a numerical event or more accurately an S-probability. A set P of numerical events including the constant functions 0 and 1 and 1-p with every p in P becomes a poset when ordered by the order of real functions and can serve as a general setting for quantum logics. We call such a poset P a general set of events (GSE). The thoroughly investigated algebras of S-probabilities (including Hilbert logics), concrete logics and Boolean algebras can all be represented within this setting. In this paper we study various classes of GSEs, in particular those that are orthoposets and their interrelations and connections to known logics. Moreover, we characterize GSEs as posets by means of states and discuss the situation for GSEs to be lattices.

quant-pharXiv:2601.00772•Reports on Mathematical Physics•Jan 5, 2026•0 citations
Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation Δ\mathrel \DeltaΔ and a binary operator d(x,y)d(x,y)d(x,y) that are generalizations of the binary relation C\textrm{C}C and the commutator c(x,y)c(x,y)c(x,y), respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations Δ\mathrel \DeltaΔ and ↔\leftrightarrow↔ (the latter was introduced by P. Pták and S. Pulmannová) and the operator d(x,y)d(x,y)d(x,y). In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of Δ\DeltaΔ-blocks with respect to Boolean subalgebras and distributive subposets they include.
Sachs showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham, at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.
According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.
We show that the category of orthomodular posets is a full coreflective subcategory of the category of strong orthoposets, those orthoposets in which any two orthogonal elements have a join. This coreflection is obtained by building from a strong orthoposet PPP, an orthomodular poset with the same underlying set and same orthocomplementation as PPP, but with modified order. This coreflector restricts to a functor from the category of ortholattices to the category of orthomodular posets, and this functor is right adjoint.
Mathematical description of quantum phenomena requires an event structure more general than a Boolean algebra. For this purpose, Birkhoff and von Neumann proposed the notion of an orthomodular lattice. Its typical feature is the existence of so–called non–commuting events, which are not simultaneously observable (like position and momentum, according to Heisenberg’s uncertainty principle). There is an old open problem whether the word problem for orthomodular lattices is solvable. Is it possible to decide whether two formulas are equivalent? In Boolean algebras, an easy positive answer is given by a transformation of the formula to a unique normal form. This requires the commutativity, associativity, and distributivity of the Boolean operations (disjunction and conjunction). In orthomodular lattices, the corresponding lattice operations (join and meet) violate distributivity. This disables the use of normal forms. We looked for alternative approaches. E.g., the join is only one of six orthomodular lattice operations generalizing the disjunction. In the thesis, we study the question whether some of the 96 binary operations in orthomodular lattices admit normal forms similar to the classical logic. The first question was which operations satisfy the associative identity, eventually under the assumption that some variables commute. Then we studied monotonicity because it is related to distributivity over the meet and join. The conclusion is that there is no pair of operations in orthomodular lattices admitting “Boolean–like” normal forms. In the last chapter we study “Moufang–like” identities, which were inspired by the algebras of quaternions and octonions. These identities generalize associativity and may enable further progress. As a by–product, we proved interesting, yet unknown, properties of some orthomodular lattice operations (e.g., the Sasaki projection). These new tools simplify algebraic computations and give a chance to develop algorithms more general than the current specialized software.
Let S be a set of states of a physical system and p(s) the probability of the occurrence of an event when the system is in state s in S. Such a function p from S to [0,1] is known as a numerical event or more accurately an S-probability. A set P of numerical events including the constant functions 0 and 1 and 1-p with every p in P becomes a poset when ordered by the order of real functions and can serve as a general setting for quantum logics. We call such a poset P a general set of events (GSE). The thoroughly investigated algebras of S-probabilities (including Hilbert logics), concrete logics and Boolean algebras can all be represented within this setting. In this paper we study various classes of GSEs, in particular those that are orthoposets and their interrelations and connections to known logics. Moreover, we characterize GSEs as posets by means of states and discuss the situation for GSEs to be lattices.