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

Journal of Symbolic Logic

Sequential method in quantum logic

Hirokazu Nishimura

Published Jun 1, 1980• 54 citations
Publisher

Abstract

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.

DOI
10.2307/2273194

Related papers

Quantum logic with implication.

J. Jay Zeman

The non-classical nature of quantum theory has led to a number of efforts to formalize the logic of statements whose universe of discourse is the subatomic (see, for example, [3], [6], [8], and [10]).It might be hoped that ideally the fruit of such efforts would be a formalism not totally divorced from the classical logic, but incorporating or incorporated in it in such a manner as to unify the logic of the micro-and the macro-worlds.Indeed, this has been the general direction taken by these efforts, including that which we principally examine and expand upon here.*Josef Jauch, [6], pp.67-89, developed a "propositional calculus of quantum mechanics".He objected to calling a system like his a "logic of quantum mechanics"; however, our use of 'logic' here is not, I think, the use to which Jauch objected.A logic, for our present purposes, is a mathematical formalism having a reasonable interpretation as a theory of deduction; its actual application as normative of argumentation in reality is a matter of empirical judgment.This seems close to the way Jauch wished to use "propositional calculus" but more general, allowing for extension to a quantification theory of quantum mechanics, for example.Although Jauch's presentation of a propositional calculus of quantum mechanics is mathematically interesting and suggestive, there are a number of problems connected with it.It is our purpose to engage some of these problems and to present a rigorously defined formalism intended to come close to doing the job intended by Jauch for his logic.The success or lack of success of this effort as related to actual application of this formalism in the foundations of quantum theory is, I think, a matter for the physicists to decide; the empirical judgment involved in this application is not in the scope of this paper.If a formalism is to have a reasonable interpretation as a theory of deduction, it seems clear that it must include a relation which, when it holds between two elements of the formalism, may be reasonably interpreted as expressing that one of the elements 'follows from' the other, in •The author wishes to thank Robert Piziak for advice and comments in the course of research for this paper.

Notre Dame Journal of Formal Logic•Oct 1, 1979•19 citations

Quantum Logic

David J. Foulis, Richard J. Greechie, María Luisa Dalla Chiara +1 more

This chapter contains sections titled: Brief History of Quantum Logic The Origin of Quantum Logic The Work of Birkhoff and von Neumann The Orthomodular Law The Interpretation of Meet and Join Standard Quantum Logic The Orthomodular Lattice of Projections on a Hilbert Space Observables States Superposition of States Dynamics Combinations of Standard Quantum Logics Orthoalgebras as Models for a General Quantum Logic Orthoalgebras Compatibility, Conjunction, and Disjunction in an Orthoalgebra Probability Measures on and Supports in an Orthoalgebra Cartesian and Tensor Products of Orthoalgebras The Logic of a Physical System The Canonical Mapping Critique of Quantum Logic The Logician's Approach Algebraic and Possible-World Semantics Orthodox Quantum Logic Semantic Characterizations of QL An Axiomatization of QL Orthologic and Unsharp Quantum Logics Hilbert-Space Models of the Brouwer–Zadeh Logics Partial Quantum Logics Algebraic Semantics for WPaQL An Axiomatization of Partial Quantum Logics Critique of Abstract Quantum Logics

Wiley eBooks•Aug 24, 2005•1 citation

On the structure of quantum logic

Peter D. Finch

In the axiomatic development of the logic of nonrelativistic quantum mechanics it is not difficult to set down certain plausible axioms which ensure that the quantum logic of propositions has the structure of an orthomodular poset. This can be done in a number of ways, for example, as in Gunson [2], Mackey [4], Piron [5], Varadarajan [7] and Zierler [8], and we summarise one of these ways in §2 below.

Journal of Symbolic Logic•Jul 25, 1969•50 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

Quantum Logic

Peter Mittelstaedt

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.

PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association•Jan 1, 1974•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
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.
The non-classical nature of quantum theory has led to a number of efforts to formalize the logic of statements whose universe of discourse is the subatomic (see, for example, [3], [6], [8], and [10]).It might be hoped that ideally the fruit of such efforts would be a formalism not totally divorced from the classical logic, but incorporating or incorporated in it in such a manner as to unify the logic of the micro-and the macro-worlds.Indeed, this has been the general direction taken by these efforts, including that which we principally examine and expand upon here.*Josef Jauch, [6], pp.67-89, developed a "propositional calculus of quantum mechanics".He objected to calling a system like his a "logic of quantum mechanics"; however, our use of 'logic' here is not, I think, the use to which Jauch objected.A logic, for our present purposes, is a mathematical formalism having a reasonable interpretation as a theory of deduction; its actual application as normative of argumentation in reality is a matter of empirical judgment.This seems close to the way Jauch wished to use "propositional calculus" but more general, allowing for extension to a quantification theory of quantum mechanics, for example.Although Jauch's presentation of a propositional calculus of quantum mechanics is mathematically interesting and suggestive, there are a number of problems connected with it.It is our purpose to engage some of these problems and to present a rigorously defined formalism intended to come close to doing the job intended by Jauch for his logic.The success or lack of success of this effort as related to actual application of this formalism in the foundations of quantum theory is, I think, a matter for the physicists to decide; the empirical judgment involved in this application is not in the scope of this paper.If a formalism is to have a reasonable interpretation as a theory of deduction, it seems clear that it must include a relation which, when it holds between two elements of the formalism, may be reasonably interpreted as expressing that one of the elements 'follows from' the other, in •The author wishes to thank Robert Piziak for advice and comments in the course of research for this paper.
This chapter contains sections titled: Brief History of Quantum Logic The Origin of Quantum Logic The Work of Birkhoff and von Neumann The Orthomodular Law The Interpretation of Meet and Join Standard Quantum Logic The Orthomodular Lattice of Projections on a Hilbert Space Observables States Superposition of States Dynamics Combinations of Standard Quantum Logics Orthoalgebras as Models for a General Quantum Logic Orthoalgebras Compatibility, Conjunction, and Disjunction in an Orthoalgebra Probability Measures on and Supports in an Orthoalgebra Cartesian and Tensor Products of Orthoalgebras The Logic of a Physical System The Canonical Mapping Critique of Quantum Logic The Logician's Approach Algebraic and Possible-World Semantics Orthodox Quantum Logic Semantic Characterizations of QL An Axiomatization of QL Orthologic and Unsharp Quantum Logics Hilbert-Space Models of the Brouwer–Zadeh Logics Partial Quantum Logics Algebraic Semantics for WPaQL An Axiomatization of Partial Quantum Logics Critique of Abstract Quantum Logics
§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.
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.
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.