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

Applications of Mathematics

On the concreteness of quantum logics

Pavel Pták, J. D. Maitland Wright

Published Jan 1, 1985• 8 citations
Publisher

Abstract

It is shown that for any quantum logic $L$ one can find a concrete logic $K$ and a surjective homomorphism $f$ from $K$ onto $L$ such that $f$ maps the centre of $K$ onto the centre of $L$. Moreover, one can ensure that each finite set of compatible elements in $L$ is the image of a compatible subset of $K$. This result is "best possible" - let a logic $L$ be the homomorphic image of a concrete logic under a homomorphism such that, if $F$ is a finite subset of the pre-image of a compatible subset of $L$, then $F$ is compatible. Then $L$ must be concrete. In the second part one considers embeddings into concrete logics. It is shown that any concrete logic can be embedded into a concrete logic with preassigned centre and an abundance of two-valued measures. Finally, one proves that an arbitrary logic can be mapped into a concrete logic by a centrally additive mapping which preserves the ordering and complementation.

DOI
10.21136/am.1985.104150

Related papers

Quantum Logics with Lattice State Spaces

Jiří Binder, Mirko Navara

Let $L$ be a quantum logic and let $S(L)$ denote the set of all states on $L$. (By a state we mean a nonnegative bounded $\sigma$-additive measure, not necessarily normalized.) We ask whether every logic whose state space is a lattice has to be Boolean. We prove that this is so for finite logics and "projection logics." On the other hand, we show that there exist even concrete non-Boolean logics with a lattice state space (in fact, we prove that every countable concrete logic can be enlarged to a logic with a lattice state space). In the appendix we shortly consider the lattice properties of the set of observables and correct the paper [10].

Proceedings of the American Mathematical Society•Jan 1, 1987•5 citations

Concrete quantum logics with generalised compatibility

Josef Tkadlec

We present three results stating when a concrete (=set-representable) quantum logic with covering properties (generalization of compatibility) has to be a Boolean algebra. These results complete and generalize some previous results [3, 5] and answer partiallz a question posed in [2].

Mathematica Bohemica•Jan 1, 1998•1 citation

On joint distribution in quantum logics. II. Noncompatible observables

Anatolij Dvurečenskij

This paper i a continuation of the first part under the same title. The author studies a joint distribution in $\sigma$-finite measures for noncompatible observables of a quantum logic defined on some system of $\sigma$-independent Boolean sub-$\sigma$-algebras of a Boolean $\sigma$-algebra. We present some necessary and sufficient conditions fot the existence of a joint distribution. In particular, it is shown that an arbitrary system of obsevables has a joint distribution in a measure iff it may be embedded into a system of compatible observables of some quantum logic. The methods used are different from those developed for finite measures. Finally, the author deals with the connection between the existence of a joint distribution and the existence of a commutator of observables, and the quantum logic of a nonseparable Hilbert space is mentioned.

Applications of Mathematics•Jan 1, 1987•1 citation

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

Quantum Logic as the Logic of Contexts

Haruki Emori, Atsushi Iriki, Andrei Khrennikov +1 more

Quantum logic is usually presented as a non-classical departure from ordinary reasoning forced on us by quantum mechanics, with classical logic kept as the secure starting point. We argue for the opposite order of explanation in a finite and fully computable setting. The free orthomodular lattice on two generators has ninety-six elements, the direct product of a six-element non-distributive factor and a sixteen-element Boolean factor. Reading the first factor as a register of contexts and the second as Boolean content, we obtain a calculus whose elements are context--bit-vector pairs and whose operations act component by component. With this calculus we establish three results. First, we classify the six layers by commutativity, identifying the central kernel of context-neutral propositions together with a dual central layer in which all complementary contexts are present. Second, we show that orthocomplementation rearranges the layers exactly as the complementation of the small factor rearranges its elements, which makes the duality among the layers rigid rather than accidental. Third, we prove that the operation forgetting the context is a surjective homomorphism of orthocomplemented lattices whose quotient is the classical Boolean algebra, so that classical logic is a six-to-one, information-losing image of the contextual calculus.

quant-pharXiv:2607.09032•Jul 13, 2026•0 citations

Preserver problems for the logics associated to Hilbert spaces and related Grassmannians

Mark Pankov

We consider the standard quantum logic ${\mathcal L}(H)$ associated to a complex Hilbert space $H$, i.e. the lattice of closed subspaces of $H$ together with the orthogonal complementation. The orthogonality and compatibility relations are defined for any logic. In the standard quantum logic, they have a simple interpretation in terms of operator theory. For example, two closed subspaces (propositions in the logic ${\mathcal L}(H)$) are compatible if and only if the projections on these subspaces commute. We present both classical and more resent results on transformations of ${\mathcal L}(H)$ and the associated Grassmannians which preserve the orthogonality or compatibility relation. The first result in this direction was classical Wigner's theorem.

arXiv:1702.03157•Feb 10, 2017•0 citations
It is shown that for any quantum logic LLL one can find a concrete logic KKK and a surjective homomorphism fff from KKK onto LLL such that fff maps the centre of KKK onto the centre of LLL. Moreover, one can ensure that each finite set of compatible elements in LLL is the image of a compatible subset of KKK. This result is "best possible" - let a logic LLL be the homomorphic image of a concrete logic under a homomorphism such that, if FFF is a finite subset of the pre-image of a compatible subset of LLL, then FFF is compatible. Then LLL must be concrete. In the second part one considers embeddings into concrete logics. It is shown that any concrete logic can be embedded into a concrete logic with preassigned centre and an abundance of two-valued measures. Finally, one proves that an arbitrary logic can be mapped into a concrete logic by a centrally additive mapping which preserves the ordering and complementation.
Let LLL be a quantum logic and let S(L)S(L)S(L) denote the set of all states on LLL. (By a state we mean a nonnegative bounded σ\sigmaσ-additive measure, not necessarily normalized.) We ask whether every logic whose state space is a lattice has to be Boolean. We prove that this is so for finite logics and "projection logics." On the other hand, we show that there exist even concrete non-Boolean logics with a lattice state space (in fact, we prove that every countable concrete logic can be enlarged to a logic with a lattice state space). In the appendix we shortly consider the lattice properties of the set of observables and correct the paper [10].
This paper i a continuation of the first part under the same title. The author studies a joint distribution in σ\sigmaσ-finite measures for noncompatible observables of a quantum logic defined on some system of σ\sigmaσ-independent Boolean sub-σ\sigmaσ-algebras of a Boolean σ\sigmaσ-algebra. We present some necessary and sufficient conditions fot the existence of a joint distribution. In particular, it is shown that an arbitrary system of obsevables has a joint distribution in a measure iff it may be embedded into a system of compatible observables of some quantum logic. The methods used are different from those developed for finite measures. Finally, the author deals with the connection between the existence of a joint distribution and the existence of a commutator of observables, and the quantum logic of a nonseparable Hilbert space is mentioned.
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.
Quantum logic is usually presented as a non-classical departure from ordinary reasoning forced on us by quantum mechanics, with classical logic kept as the secure starting point. We argue for the opposite order of explanation in a finite and fully computable setting. The free orthomodular lattice on two generators has ninety-six elements, the direct product of a six-element non-distributive factor and a sixteen-element Boolean factor. Reading the first factor as a register of contexts and the second as Boolean content, we obtain a calculus whose elements are context--bit-vector pairs and whose operations act component by component. With this calculus we establish three results. First, we classify the six layers by commutativity, identifying the central kernel of context-neutral propositions together with a dual central layer in which all complementary contexts are present. Second, we show that orthocomplementation rearranges the layers exactly as the complementation of the small factor rearranges its elements, which makes the duality among the layers rigid rather than accidental. Third, we prove that the operation forgetting the context is a surjective homomorphism of orthocomplemented lattices whose quotient is the classical Boolean algebra, so that classical logic is a six-to-one, information-losing image of the contextual calculus.
We consider the standard quantum logic L(H){\mathcal L}(H)L(H) associated to a complex Hilbert space HHH, i.e. the lattice of closed subspaces of HHH together with the orthogonal complementation. The orthogonality and compatibility relations are defined for any logic. In the standard quantum logic, they have a simple interpretation in terms of operator theory. For example, two closed subspaces (propositions in the logic L(H){\mathcal L}(H)L(H)) are compatible if and only if the projections on these subspaces commute. We present both classical and more resent results on transformations of L(H){\mathcal L}(H)L(H) and the associated Grassmannians which preserve the orthogonality or compatibility relation. The first result in this direction was classical Wigner's theorem.