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

Commentationes Mathematicae Universitatis Carolinae

Relatively additive states on quantum logics

Pavel Pták, Hans Weber

Published Jan 1, 2005• 1 citation
OpenAlex

Abstract

summary:In this paper we carry on the investigation of partially additive states on quantum logics (see [2], [5], [7], [8], [11], [12], [15], [18], etc.). We study a variant of weak states — the states which are additive with respect to a given Boolean subalgebra. In the first result we show that there are many quantum logics which do not possess any 2-additive central states (any logic possesses an abundance of 1-additive central state — see [12]). In the second result we construct a finite 3-homogeneous quantum logic which does not possess any two-valued 1-additive state with respect to a given Boolean subalgebra. This result strengthens Theorem 2 of [5] and presents a rather advanced example in the orthomodular combinatorics (see also [9], [13], [4], [6], [16], etc.). In the rest we show that Greechie logics allow for $2$-additive three-valued states, and in case of Greechie lattices we show that one can even construct many $2$-additive two-valued states. Some open questions are posed, too.

Related papers

Simultaneous extensions of states on quantum logics

Dominika Burešová, Pavel Pták, Jan Ševic

Suppose that L is a quantum logic (= an orthomodular poset) and A, B are Boolean subalgebras of L. Suppose further that s1(resp. s2) is a state on A (resp. on B). We ask when both s1 and s2 allow for a simultaneous extension over L. Under a natural necessity condition on A, B, s1, s2 we find a sufficient condition for the existence of the extension. This condition is the requirement of an abundance of two-valued states on L. We then show by the Greechie pasting technique that this condition is far from necessary even for state-space-rich logics.

arXiv:2609.10770•Sep 9, 2026•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

Greechie diagrams, nonexistence of measures in quantum logics, and Kochen–Specker-type constructions

Karl Svozil, Josef Tkadlec

We use Greechie diagrams to construct finite orthomodular lattices ‘‘realizable’’ in the orthomodular lattice of subspaces in a three-dimensional Hilbert space such that the set of two-valued states is not ‘‘large’’ (i.e., full, separating, unital, nonempty, resp.). We discuss the number of elements of such orthomodular lattices, of their sets of (ortho)generators and of their subsets that do not admit a ‘‘large’’ set of two-valued states. We show connections with other results of this type.

Journal of Mathematical Physics•Nov 1, 1996•66 citations

Weak dispersion-free states and the hidden variables hypothesis

Pavel Pták

We investigate dispersion-free states which are additive only on the pairs containing a central element (central-absolutely compatible). We show that any logic possesses plenty of such states, in fact, as many as a certain Boolean algebra. The latter result matches the hidden variables conjecture.

Journal of Mathematical Physics•Apr 1, 1983•12 citations

On the lattice structure of quantum logic

Peter D. Finch

A weak logical structure is defined as a set of boolean propositional logics in which one can define common operations of negation and implication. The set union of the boolean components of a weak logical structure is a logic of propositions which is an orthocomplemented poset, where orthocomplementation is interpreted as negation and the partial order as implication. It is shown that if one can define on this logic an operation of logical conjunction which has certain plausible properties, then the logic has the structure of an orthomodular lattice. Conversely, if the logic is an orthomodular lattice then the conjunction operation may be defined on it.

Bulletin of the Australian Mathematical Society•Dec 1, 1969•15 citations

On the concreteness of quantum logics

Pavel Pták, J. D. Maitland Wright

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.

Applications of Mathematics•Jan 1, 1985•8 citations
summary:In this paper we carry on the investigation of partially additive states on quantum logics (see [2], [5], [7], [8], [11], [12], [15], [18], etc.). We study a variant of weak states — the states which are additive with respect to a given Boolean subalgebra. In the first result we show that there are many quantum logics which do not possess any 2-additive central states (any logic possesses an abundance of 1-additive central state — see [12]). In the second result we construct a finite 3-homogeneous quantum logic which does not possess any two-valued 1-additive state with respect to a given Boolean subalgebra. This result strengthens Theorem 2 of [5] and presents a rather advanced example in the orthomodular combinatorics (see also [9], [13], [4], [6], [16], etc.). In the rest we show that Greechie logics allow for 222-additive three-valued states, and in case of Greechie lattices we show that one can even construct many 222-additive two-valued states. Some open questions are posed, too.
Suppose that L is a quantum logic (= an orthomodular poset) and A, B are Boolean subalgebras of L. Suppose further that s1(resp. s2) is a state on A (resp. on B). We ask when both s1 and s2 allow for a simultaneous extension over L. Under a natural necessity condition on A, B, s1, s2 we find a sufficient condition for the existence of the extension. This condition is the requirement of an abundance of two-valued states on L. We then show by the Greechie pasting technique that this condition is far from necessary even for state-space-rich logics.
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 use Greechie diagrams to construct finite orthomodular lattices ‘‘realizable’’ in the orthomodular lattice of subspaces in a three-dimensional Hilbert space such that the set of two-valued states is not ‘‘large’’ (i.e., full, separating, unital, nonempty, resp.). We discuss the number of elements of such orthomodular lattices, of their sets of (ortho)generators and of their subsets that do not admit a ‘‘large’’ set of two-valued states. We show connections with other results of this type.
A weak logical structure is defined as a set of boolean propositional logics in which one can define common operations of negation and implication. The set union of the boolean components of a weak logical structure is a logic of propositions which is an orthocomplemented poset, where orthocomplementation is interpreted as negation and the partial order as implication. It is shown that if one can define on this logic an operation of logical conjunction which has certain plausible properties, then the logic has the structure of an orthomodular lattice. Conversely, if the logic is an orthomodular lattice then the conjunction operation may be defined on it.
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.