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:1408.0053 · Electronic Proceedings in Theoretical Computer Science

Between quantum logic and concurrency

Luca Bernardinello, Carlo Ferigato, Lucia Pomello

Published Jul 29, 2014• 1 citation
arXivHTMLPDF

Abstract

We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line) of such a partially ordered set meets every maximal antichain (cut), then the two closure operators coincide, and generate a complete orthomodular lattice. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence "classical") substructures of the overall quantum logic.

DOI
10.4204/eptcs.158.6

Related papers

Between quantum logic and concurrency

Luca Bernardinello, Carlo Ferigato, Lucia Pomello

We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line) of such a partially ordered set meets every maximal antichain (cut), then the two closure operators coincide, and generate a complete orthomodular lattice. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence “classical”) substructures of the overall quantum logic. 1

•Jan 1, 2012•1 citation

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

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

An axiomatisation of quantum logic

Ian Clark

The purpose of this paper is to give an axiom system for quantum logic. Here quantum logic is considered to have the structure of an orthomodular lattice. Some authors assume that it has the structure of an orthomodular poset. In finding this axiom system the implication algebra given in Finch [1] has been very useful. Finch shows there that this algebra can be produced from an orthomodular lattice and vice versa. Definition. An orthocomplementation N on a poset (partially ordered set) whose partial ordering is denoted by ≤ and which has least and greatest elements 0 and 1 is a unary operation satisfying the following: (1) the greatest lower bound of a and Na exists and is 0, (2) a ≤ b implies Nb ≤ Na, (3) NNa = a. Definition. An orthomodular lattice is a lattice with meet ∧, join ∨, least and greatest elements 0 and 1 and an orthocomplementation N satisfying where a ≤ b means a ∧ b = a, as usual. Definition. A Finch implication algebra is a poset with a partial ordering ≤, least and greatest elements 0 and 1 which is orthocomplemented by N. In addition, it has a binary operation → satisfying the following: An orthomodular lattice gives a Finch implication algebra by defining → by A Finch implication algebra can be changed into an orthomodular lattice by defining the meet ∧ and join ∨ by The orthocomplementation is unchanged in both cases.

Journal of Symbolic Logic•Sep 1, 1973•13 citations

Boolean embeddings of orthomodular sets and quantum logic

Neal Zierler, Michael Schlessinger

By a “quantum logic” we mean a pair F, P where P is a set and F is a set of functions from P to the closed real unit interval satisfying three postulates which we describe in intuitive terms here. Cf. [2], [4], [7]. P may be interpreted as the set of events and F the set of states of a “physical system”, and f(x) then becomes the probability of occurrence of the event x in the state f. Since the outcome of an experiment is an estimate for some f(x), or a collection of such estimates, it is natural to identify events which cannot be distinguished by experiment.

Duke Mathematical Journal•Jun 1, 1965•73 citations

Logique quantique et intrication

Pierre Uzan

Due to the failure of the classical principles of bivalence and verifunctionality, the logic of experimental propositions relative to quantum systems cannot be interpreted in Boolean algebras. However, we cannot say neither that this logic is captured by orthomodular lattices, as claimed by many authors along the line of Birkhoff's and von Neumann's standard approach. For the alleged violation of distributivity is based on the possibility of combining statements relative to complementary contexts, which does not refer to any experience and, consequently, has no meaning. Indeed, quantum logic should be interpreted in partial, transitive Boolean algebras whose compatibility relation limits the application of the connectives within each of its Boolean sub-algebras, which refer to partial, classical descriptions. Moreover, this approach of quantum logic makes it possible to deal with composite systems, which was not possible to do within the standard approach, and then to deal with the fundamental notion of quantum entanglement. The latter notion can be represented by a series of axioms of the object language that restrict the set of experimental statements bearing on a composite system, while its close link to the notion of complementarity can be expressed in the metalanguage.

Logos & Episteme•Jan 1, 2014•0 citations
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line) of such a partially ordered set meets every maximal antichain (cut), then the two closure operators coincide, and generate a complete orthomodular lattice. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence "classical") substructures of the overall quantum logic.
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line) of such a partially ordered set meets every maximal antichain (cut), then the two closure operators coincide, and generate a complete orthomodular lattice. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence “classical”) substructures of the overall quantum logic. 1
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.
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.
The purpose of this paper is to give an axiom system for quantum logic. Here quantum logic is considered to have the structure of an orthomodular lattice. Some authors assume that it has the structure of an orthomodular poset. In finding this axiom system the implication algebra given in Finch [1] has been very useful. Finch shows there that this algebra can be produced from an orthomodular lattice and vice versa. Definition. An orthocomplementation N on a poset (partially ordered set) whose partial ordering is denoted by ≤ and which has least and greatest elements 0 and 1 is a unary operation satisfying the following: (1) the greatest lower bound of a and Na exists and is 0, (2) a ≤ b implies Nb ≤ Na, (3) NNa = a. Definition. An orthomodular lattice is a lattice with meet ∧, join ∨, least and greatest elements 0 and 1 and an orthocomplementation N satisfying where a ≤ b means a ∧ b = a, as usual. Definition. A Finch implication algebra is a poset with a partial ordering ≤, least and greatest elements 0 and 1 which is orthocomplemented by N. In addition, it has a binary operation → satisfying the following: An orthomodular lattice gives a Finch implication algebra by defining → by A Finch implication algebra can be changed into an orthomodular lattice by defining the meet ∧ and join ∨ by The orthocomplementation is unchanged in both cases.
By a “quantum logic” we mean a pair F, P where P is a set and F is a set of functions from P to the closed real unit interval satisfying three postulates which we describe in intuitive terms here. Cf. [2], [4], [7]. P may be interpreted as the set of events and F the set of states of a “physical system”, and f(x) then becomes the probability of occurrence of the event x in the state f. Since the outcome of an experiment is an estimate for some f(x), or a collection of such estimates, it is natural to identify events which cannot be distinguished by experiment.
Due to the failure of the classical principles of bivalence and verifunctionality, the logic of experimental propositions relative to quantum systems cannot be interpreted in Boolean algebras. However, we cannot say neither that this logic is captured by orthomodular lattices, as claimed by many authors along the line of Birkhoff's and von Neumann's standard approach. For the alleged violation of distributivity is based on the possibility of combining statements relative to complementary contexts, which does not refer to any experience and, consequently, has no meaning. Indeed, quantum logic should be interpreted in partial, transitive Boolean algebras whose compatibility relation limits the application of the connectives within each of its Boolean sub-algebras, which refer to partial, classical descriptions. Moreover, this approach of quantum logic makes it possible to deal with composite systems, which was not possible to do within the standard approach, and then to deal with the fundamental notion of quantum entanglement. The latter notion can be represented by a series of axioms of the object language that restrict the set of experimental statements bearing on a composite system, while its close link to the notion of complementarity can be expressed in the metalanguage.