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

PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association

Quantum Logic

Peter Mittelstaedt

Published Jan 1, 1974• 0 citations
Publisher

Abstract

It has been shown by Birkhoff and v. Neumann (1936) and by Jauch and Piron (1963,1964,1968) that the subspaces of Hilbert space constitute an orthocomplemented quasi-modular lattice Lq, if one considers between two subspaces (elements) a, b the relation a⊆b and the operations a∩b, a∪b, a⊥. Furthermore, since the subspaces can be interpreted as quantum mechanical propositions, and since the operations ∩,∪ ,⊥ have some similarity with the logical operations ⋀ (and), ⋁ (or) and ⌝ (not), the question has been raised already by Birkhoff and v. Neumann, whether the lattice of subspaces of Hilbert space can be interpreted as a propositional calculus, sometimes called quantum logic. There are many kinds of lattices which can be interpreted as a propositional or logical calculus. A Boolean lattice LB of propositions corresponds to the calculus of classical logic and an implicative (Birkhoff, 1961) lattice Li has as a model the calculus of effective (intuitionistic) logic.

DOI
10.1086/psaprocbienmeetp.1974.495823

Related papers

On the Interpretation of the Lattice of Subspaces of the Hilbert Space as a Propositional Calculus

Peter Mittelstaedt

Abstract In the lattice of subspaces of the Hilbert space elements can be defined which may be con-sidered as generalized implications. It is shown, that these elements satisfy the most important relations which are known to be valid for the classical implication. These results seem to justify the interpretation of this lattice as a propositional calculus sometime called quantum logic.

Zeitschrift für Naturforschung A•Sep 1, 1972•50 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

Quantum logic as motivated by quantum computing

Jon Michael Dunn, Tobias Hagge, Lawrence S. Moss +1 more

§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection. The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.

arXiv:math/0412144•Journal of Symbolic Logic•Jun 1, 2005•24 citations

The quantum logic of direct-sumdecompositions: the dual to the quantum logic of subspaces

David Ellerman

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the ‘quantum logic’ of subspaces of a general vector space—which is then specialized to the closed subspaces of a Hilbert space. But there is a ‘dual’ progression. The set notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of set partitions to the quantum logic of direct-sum decompositions (i.e. the vector space version of a set partition) of a general vector space—which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the quantum logic of direct-sum decompositions to express measurement by any self-adjoint operators. The quantum logic of direct-sum decompositions is dual to the usual quantum logic of subspaces in the same sense that the logic of partitions is dual to the usual Boolean logic of subsets.

arXiv:1604.01087•Logic Journal of IGPL•Jun 27, 2017•19 citations

Sequential method in quantum logic

Hirokazu Nishimura

Since Birkhoff and von Neumann [2] a new area of logical investigation has grown up under the name of quantum logic. However it seems to me that many authors have been inclined to discuss algebraic semantics as such (mainly lattices of a certain kind) almost directly without presenting any axiomatic system, far from developing any proof theory of quantum logic. See, e.g., Gunson [9], Jauch [10], Varadarajan [15], Zeirler [16], etc. In this sense many works presented under the name of quantum logic are algebraic in essence rather than genuinely logical, though it is absurd to doubt the close relationship between algebraic and logical study on quantum mechanics. The main purpose of this paper is to alter this situation by presenting an axiomatization of quantum logic as natural and as elegant as possible, which further proof-theoretical study is to be based on. It is true that several axiomatizations of quantum logic are present now. Several authors have investigated the so-called material implication α → β ( = ¬α∨(α ∧ β)) very closely with due regard to its importance. See, e.g., Finch [5], Piziak [11], etc. Indeed material implication plays a predominant role in any axiomatization of a logic in Hilbert-style. Clark [4] has presented an axiomatization of quantum logic with negation ¬ and material implication → as primitive connectives. In this paper we do not follow this approach. First of all, this approach is greatly complicated because orthomodular lattices are only locally distributive.

Journal of Symbolic Logic•Jun 1, 1980•54 citations

The center of an orthologic

Barbara Jeffcott

Since 1933, when Kolmogorov laid the foundations for probability and statistics as we know them today [1], it has been recognized that propositions asserting that such and such an event occurred as a consequence of the execution of a particular random experiment tend to band together and form a Boolean algebra. In 1936, Birkhoff and von Neumann [2] suggested that the so-called logic of quantum mechanics should not be a Boolean algebra, but rather should form what is now called a modular ortholattice [3]. Presumably, the departure from Boolean algebras encountered in quantum mechanics can be attributed to the fact that in quantum mechanics, one must consider more than one physical experiment, e.g., an experiment measuring position, an experiment measuring charge, an experiment measuring momentum, etc., and, because of the uncertainty principle, these experiments need not admit a common refinement in terms of which the Kolmogorov theory is directly applicable. Mackey's Axioms I–VI for quantum mechanics [4] imply that the logic of quantum mechanics should be a σ-orthocomplete orthomodular poset [5]. Most contemporary practitioners of quantum logic seem to agree that a quantum logic is (at least) an orthomodular poset [6], [7], [8], [9], [10] or some variation thereof [11]. P. D. Finch [12] has shown that every completely orthomodular poset is the logic arising from sets of Boolean logics, where these sets have a structure similar to the structures generally given to quantum logic. In all of these versions of quantum logic, a fundamental relation, the relation of compatibility or commutativity, plays a decisive role.

Journal of Symbolic Logic•Dec 1, 1972•15 citations
It has been shown by Birkhoff and v. Neumann (1936) and by Jauch and Piron (1963,1964,1968) that the subspaces of Hilbert space constitute an orthocomplemented quasi-modular lattice Lq, if one considers between two subspaces (elements) a, b the relation a⊆b and the operations a∩b, a∪b, a⊥. Furthermore, since the subspaces can be interpreted as quantum mechanical propositions, and since the operations ∩,∪ ,⊥ have some similarity with the logical operations ⋀ (and), ⋁ (or) and ⌝ (not), the question has been raised already by Birkhoff and v. Neumann, whether the lattice of subspaces of Hilbert space can be interpreted as a propositional calculus, sometimes called quantum logic. There are many kinds of lattices which can be interpreted as a propositional or logical calculus. A Boolean lattice LB of propositions corresponds to the calculus of classical logic and an implicative (Birkhoff, 1961) lattice Li has as a model the calculus of effective (intuitionistic) logic.
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.
§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection. The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.
Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the ‘quantum logic’ of subspaces of a general vector space—which is then specialized to the closed subspaces of a Hilbert space. But there is a ‘dual’ progression. The set notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of set partitions to the quantum logic of direct-sum decompositions (i.e. the vector space version of a set partition) of a general vector space—which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the quantum logic of direct-sum decompositions to express measurement by any self-adjoint operators. The quantum logic of direct-sum decompositions is dual to the usual quantum logic of subspaces in the same sense that the logic of partitions is dual to the usual Boolean logic of subsets.
Since Birkhoff and von Neumann [2] a new area of logical investigation has grown up under the name of quantum logic. However it seems to me that many authors have been inclined to discuss algebraic semantics as such (mainly lattices of a certain kind) almost directly without presenting any axiomatic system, far from developing any proof theory of quantum logic. See, e.g., Gunson [9], Jauch [10], Varadarajan [15], Zeirler [16], etc. In this sense many works presented under the name of quantum logic are algebraic in essence rather than genuinely logical, though it is absurd to doubt the close relationship between algebraic and logical study on quantum mechanics. The main purpose of this paper is to alter this situation by presenting an axiomatization of quantum logic as natural and as elegant as possible, which further proof-theoretical study is to be based on. It is true that several axiomatizations of quantum logic are present now. Several authors have investigated the so-called material implication α → β ( = ¬α∨(α ∧ β)) very closely with due regard to its importance. See, e.g., Finch [5], Piziak [11], etc. Indeed material implication plays a predominant role in any axiomatization of a logic in Hilbert-style. Clark [4] has presented an axiomatization of quantum logic with negation ¬ and material implication → as primitive connectives. In this paper we do not follow this approach. First of all, this approach is greatly complicated because orthomodular lattices are only locally distributive.
Since 1933, when Kolmogorov laid the foundations for probability and statistics as we know them today [1], it has been recognized that propositions asserting that such and such an event occurred as a consequence of the execution of a particular random experiment tend to band together and form a Boolean algebra. In 1936, Birkhoff and von Neumann [2] suggested that the so-called logic of quantum mechanics should not be a Boolean algebra, but rather should form what is now called a modular ortholattice [3]. Presumably, the departure from Boolean algebras encountered in quantum mechanics can be attributed to the fact that in quantum mechanics, one must consider more than one physical experiment, e.g., an experiment measuring position, an experiment measuring charge, an experiment measuring momentum, etc., and, because of the uncertainty principle, these experiments need not admit a common refinement in terms of which the Kolmogorov theory is directly applicable. Mackey's Axioms I–VI for quantum mechanics [4] imply that the logic of quantum mechanics should be a σ-orthocomplete orthomodular poset [5]. Most contemporary practitioners of quantum logic seem to agree that a quantum logic is (at least) an orthomodular poset [6], [7], [8], [9], [10] or some variation thereof [11]. P. D. Finch [12] has shown that every completely orthomodular poset is the logic arising from sets of Boolean logics, where these sets have a structure similar to the structures generally given to quantum logic. In all of these versions of quantum logic, a fundamental relation, the relation of compatibility or commutativity, plays a decisive role.