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

Philosophy of Science

Substitution and Truth in Quantum Logic

Itamar Pitowsky

Published Sep 1, 1982• 11 citations
Publisher

Abstract

If p(x1, …, xn) and q(x1 …, xn) are two logically equivalent propositions then p(π(x1), …, π(xn)) and q(π(x1), …,π(xn)) are also logically equivalent where π is an arbitrary permutation of the elementary constituents x1, …, xn. In Quantum Logic the invariance of logical equivalences breaks down. It is proved that the distribution rules of classical logic are in fact equivalent to the meta-linguistic rule of universal substitution and that the more restrictive structure of the substitution group of Quantum Logic prevents us from defining truth in a classical fashion. These observations lead to a more profound understanding of the Logic of Quantum Mechanics and of the role that symmetry principles play in that theory. … Its decisive difference in comparison to the Classical-Model is the fact that gratings in vector-space defy superposition. —Hermann Weyl (1949)

DOI
10.1086/289067

Related papers

ON THE NOTION OF PROPOSITION IN CLASSICAL AND QUANTUM MECHANICS

Claudio Garola, Sandro Sozzo

The term proposition usually denotes in quantum mechanics (QM) an element of (standard) quantum logic (QL). Within the orthodox interpretation of QM the propositions of QL cannot be associated with sentences of a language stating properties of individual samples of a physical system, since properties are nonobjective in QM. This makes the interpretation of propositions problematical. The difficulty can be removed by adopting the objective interpretation of QM proposed by one of the authors (semantic realism, or SR, interpretation). In this case, a unified perspective can be adopted for QM and classical mechanics (CM), and a simple first order predicate calculus L(x) with Tarskian semantics can be constructed such that one can associate a physical proposition (i.e., a set of physical states) with every sentence of L(x). The set $P^{f}$ of all physical propositions is partially ordered and contains a subset $P^{f}_{T}$ of testable physical propositions whose order structure depends on the criteria of testability established by the physical theory. In particular, $P^{f}_{T}$ turns out to be a Boolean lattice in CM, while it can be identified with QL in QM. Hence the propositions of QL can be associated with sentences of L(x), or also with the sentences of a suitable quantum language $L_{TQ}(x)$, and the structure of QL characterizes the notion of testability in QM. One can then show that the notion of quantum truth does not conflict with the classical notion of truth within this perspective. Furthermore, the interpretation of QL propounded here proves to be equivalent to a previous pragmatic interpretation worked out by one of the authors, and can be embodied within a more general perspective which considers states as first order predicates of a broader language with a Kripkean semantics.

arXiv:quant-ph/0603172•Conference on the Foundations of Quantum Mechanics: Historical Analysis and Open Questions•Jun 1, 2006•1 citation

Nonseparability and Quantum Logic

Bernard d’Espagnat

This talk is about quantum logic, and before we engage in the subject proper let me say how much I appreciate the invitation to deliver it that was extended to me by the Japanese Society for the Philosophy of Science.In particular because I feel that such a meeting is really the place that is most adequate for the discussion of these matters.Let us introduce the subject by mentioning a few general points.First of all, logics deals with propositions.Hence we shall be concerned with propositions.But in fact our interest will be exclusively focused on what is-or what should be the simplest type of propositions: the propositions by means of which a physicist expresses what he knows about a physical system.A priori, our subject should then be very simple.Indeed the elementary books about logic tell us that the rules concerning these propositions can be formalized.That, for example, the propositions can be combined by means of two rules, corresponding to and and to or, and that the resulting structure is just that of a Boolean Algebra.We would expect this to hold for any system.However, as you know, a major difficulty already creeps in at this point when we want to deal with atomic systems.This is because a very simple word such as "and" may well have no obvious meaning in that case.And when we try to force a meaning to it was sometimes encounter quite unpleasant surprises, exemplified by the Heisenberg relations.Among the founders of quantum physics the reactions to such a fact were quite varied as is well known.Some of them sort of hoped that the difficulty just came from our using the wrong concepts.For example, it is quite obvious that if we try to describe as a particle something which is really a wave, we are heading for trouble and we are bound to formulate some meaningless propositions.However, this remark did not lead to a satisfactory solution in the end.Other physicists notably the Copenhagen group took a very different standpoint.Substantially, what they said boiled to this: since we cannot "see" the elementary particles, let us refrain from formulating directly propositions bearing on them.Ultimately, there fore, all their propositions bear on the instruments; or should be interpreted in terms of such propositions.This is -it turned out a very good recipe.Of course, propositions bearing on instruments are propositions of classical, macroscopic physcis.As such, they fall -57-

Annals of the Japan Association for Philosophy of Science•Jan 1, 1977•0 citations

Logical Structures Arising in Quantum Theory

Simon Kochen, Ernst P. Specker

The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooks•Jan 1, 1990•86 citations

Kuantum Mantığı

Hatice Kırmacı

Quantum Logic Distributivity And The Algebraic Structure Of Propositions As with many subatomic particles, the question of under what conditions the electron behaves as a particle or as a wave continues to be the subject of research. It was necessary to employ appropriate logic to organise the propositions describing the behaviour of such an object at the subatomic scale into a precise from and to establish coherent relationships between them. Quantum logic, which can be regarded as an interpretation of quantum mechanics, arose from this need. In classical mechanics, the state and properties of a system are described using the propositions of classical logic, which is based on Boolean algebra. In quantum mechanics, however, the fact that the operators representing the measured quantities do not commute has shown that quantum phenomena cannot be described using the propositions of classical logic. It is therefore necessary to have a formal framework suited to the propositions describing quantum phenomena. In our study, we highlight the various differences between classical logic and quantum logic, examine the distributive property and discuss, from the perspective of Birkhoff and von Neumann, the algebraic structure to which quantum logic might correspond. At the conclusion of our research, we find that, in order to assert that all experimental propositions logically equivalent to a given experimental proposition constitute a physical property, the operators corresponding to the measured quantities must commute with one another. Boolean algebra has an algebraic structure that allows classical logic to be formalised. In such algebra, the distributive property holds; thus, distributivity does not pose a problem for classical logic. Consequently, the distributive property does not always hold in quantum logic and quantum systems can be modelled using orthomodular lattices associated with closed subspaces of Hilbert space. We believe that this model must evolve in parallel with the discovery of new quantum phenomena and that it provides a framework conductive to this evolution. Keywords: Quantum logic; distributivity; partially order sets (posets); lattice; orthomodular lattice; Hilbert space; Boolean algebra.

•Sep 9, 2026•0 citations

Valuations for the quantum propositional structures and hidden variables for quantum mechanics

Ariadna Chernavska

The thesis investigates the possibility of a classical semantics for quantum propositional structures. A classical semantics is defined as a set of mappings each of which is (i) bivalent, i.e., the value 1 (true) or 0 (false) is assigned to each proposition, and (ii) truth-functional, i.e., the logical operations are preserved. In addition, this set must be "full", i.e., any pair of distinct propositions is assigned different values by some mapping in the set. When the propositions make assertions about the properties of classical or of quantum systems, the mappings should also be (iii) "state-induced", i.e., values assigned by the semantics should accord with values assigned by classical or by quantum mechanics. In classical propositional logic, (equivalence classes of) propositions form a Boolean algebra, and each semantic mapping assigns the value 1 to the members of a certain subset of the algebra, namely, an ultrafilter, and assigns 0 to the members of the dual ultraideal, where the union of these two subsets is the entire algebra. The propositional structures of classical mechanics are likewise Boolean algebras, so one can straightforwardly provide a classical semantics, which also satisfies (iii). However, quantum propositional structures are non-Boolean, so it is an open question whether a semantics satisfying (i), (ii) and (iii) can be provided. Von Neumann first proposed (1932) that the algebraic structures of the subspaces (or projectors) of Hilbert space be regarded as the pro-positional structures PQM of quantum mechanics. These structures have been formalized in two ways: as orthomodular lattices which have the binary operations "and", "or", defined among all elements, compatible [symbol omitted] and incompatible [symbol omitted]; and as partial-Boolean algebras which have the binary operations defined among only compatible elements. In the thesis, two basic senses in which these structures are non-Boolean are discriminated. And two notions of truth-functionality are distinguished: truth-functionality [symbols omitted] applicable to the PQM lattices; and truth-functionality [symbol omitted] applicable to both the lattices and partial-Boolean algebras. Then it is shown how the lattice definitions of "and", "or", among incompatibles rule out a bivalent, truth-functional [symbols omitted] semantics for any lattice containing incompatible, elements. In contrast, the Gleason and Kochen-Specker proofs of the impossibility of hidden-variables for quantum mechanics show the impossibility of a bivalent, truth-functional [symbol omitted] semantics for three-or-higher dimensional Hilbert space structures; and the presence of incompatible elements is necessary but is not sufficient to rule out such a semantics. As for (iii), each quantum state-induced expectation-function on a PQM truth-functionally assigns 1 and 0 values to the elements in a ultrafilter and dual ultraideal of PQM³ where, in general the union of an ultrafilter and its dual ultraideal is smaller than the entire structure. Thus it is argued that each expectation-function is the quantum analog of a classical semantic mapping, even though the domain where each expectation-function is bivalent and truth-functional is usually a non-Boolean substructure of PQM. The final portion of the thesis surveys proposals for the introduction of hidden variables into quantum mechanics, proofs of the impossibility of such hidden-variable proposals, and criticisms of these impossibility proofs. And arguments in favour of the partial-Boolean algebra, rather than the orthomodular lattice, formalization of the quantum propositional structures are reviewed.

•Jan 1, 2010•0 citations

The Metalogic of Quantum Logic

Peter Mittelstaedt

In order to establish the object language of quantum physics, we begin with a quantum mechanical system S (atom, nucleus, elementary particle) and consider propositions A,B,… about this system S which can be proved or disproved by measuring processes. These propositions will be called elementary propositions. We will assume here that elementary propositions are value definite, i.e.,there always exists an experimental testing procedure which decides between truth and falsity of the respective proposition. The logical connectives A ∧ B (A and B), A ∨ B (A or B), A → B (A then B) and ┐ A (not A) will be defined by means of dialogs. A dialog is a formalized kind of discussion between two participants, the proponent P who asserts a certain proposition and the opponent 0 who attempts to refute it.

PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association•Jan 1, 1978•1 citation
If p(x1, …, xn) and q(x1 …, xn) are two logically equivalent propositions then p(π(x1), …, π(xn)) and q(π(x1), …,π(xn)) are also logically equivalent where π is an arbitrary permutation of the elementary constituents x1, …, xn. In Quantum Logic the invariance of logical equivalences breaks down. It is proved that the distribution rules of classical logic are in fact equivalent to the meta-linguistic rule of universal substitution and that the more restrictive structure of the substitution group of Quantum Logic prevents us from defining truth in a classical fashion. These observations lead to a more profound understanding of the Logic of Quantum Mechanics and of the role that symmetry principles play in that theory. … Its decisive difference in comparison to the Classical-Model is the fact that gratings in vector-space defy superposition. —Hermann Weyl (1949)
The term proposition usually denotes in quantum mechanics (QM) an element of (standard) quantum logic (QL). Within the orthodox interpretation of QM the propositions of QL cannot be associated with sentences of a language stating properties of individual samples of a physical system, since properties are nonobjective in QM. This makes the interpretation of propositions problematical. The difficulty can be removed by adopting the objective interpretation of QM proposed by one of the authors (semantic realism, or SR, interpretation). In this case, a unified perspective can be adopted for QM and classical mechanics (CM), and a simple first order predicate calculus L(x) with Tarskian semantics can be constructed such that one can associate a physical proposition (i.e., a set of physical states) with every sentence of L(x). The set PfP^{f}Pf of all physical propositions is partially ordered and contains a subset PTfP^{f}_{T}PTf​ of testable physical propositions whose order structure depends on the criteria of testability established by the physical theory. In particular, PTfP^{f}_{T}PTf​ turns out to be a Boolean lattice in CM, while it can be identified with QL in QM. Hence the propositions of QL can be associated with sentences of L(x), or also with the sentences of a suitable quantum language LTQ(x)L_{TQ}(x)LTQ​(x), and the structure of QL characterizes the notion of testability in QM. One can then show that the notion of quantum truth does not conflict with the classical notion of truth within this perspective. Furthermore, the interpretation of QL propounded here proves to be equivalent to a previous pragmatic interpretation worked out by one of the authors, and can be embodied within a more general perspective which considers states as first order predicates of a broader language with a Kripkean semantics.
This talk is about quantum logic, and before we engage in the subject proper let me say how much I appreciate the invitation to deliver it that was extended to me by the Japanese Society for the Philosophy of Science.In particular because I feel that such a meeting is really the place that is most adequate for the discussion of these matters.Let us introduce the subject by mentioning a few general points.First of all, logics deals with propositions.Hence we shall be concerned with propositions.But in fact our interest will be exclusively focused on what is-or what should be the simplest type of propositions: the propositions by means of which a physicist expresses what he knows about a physical system.A priori, our subject should then be very simple.Indeed the elementary books about logic tell us that the rules concerning these propositions can be formalized.That, for example, the propositions can be combined by means of two rules, corresponding to and and to or, and that the resulting structure is just that of a Boolean Algebra.We would expect this to hold for any system.However, as you know, a major difficulty already creeps in at this point when we want to deal with atomic systems.This is because a very simple word such as "and" may well have no obvious meaning in that case.And when we try to force a meaning to it was sometimes encounter quite unpleasant surprises, exemplified by the Heisenberg relations.Among the founders of quantum physics the reactions to such a fact were quite varied as is well known.Some of them sort of hoped that the difficulty just came from our using the wrong concepts.For example, it is quite obvious that if we try to describe as a particle something which is really a wave, we are heading for trouble and we are bound to formulate some meaningless propositions.However, this remark did not lead to a satisfactory solution in the end.Other physicists notably the Copenhagen group took a very different standpoint.Substantially, what they said boiled to this: since we cannot "see" the elementary particles, let us refrain from formulating directly propositions bearing on them.Ultimately, there fore, all their propositions bear on the instruments; or should be interpreted in terms of such propositions.This is -it turned out a very good recipe.Of course, propositions bearing on instruments are propositions of classical, macroscopic physcis.As such, they fall -57-
The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Quantum Logic Distributivity And The Algebraic Structure Of Propositions As with many subatomic particles, the question of under what conditions the electron behaves as a particle or as a wave continues to be the subject of research. It was necessary to employ appropriate logic to organise the propositions describing the behaviour of such an object at the subatomic scale into a precise from and to establish coherent relationships between them. Quantum logic, which can be regarded as an interpretation of quantum mechanics, arose from this need. In classical mechanics, the state and properties of a system are described using the propositions of classical logic, which is based on Boolean algebra. In quantum mechanics, however, the fact that the operators representing the measured quantities do not commute has shown that quantum phenomena cannot be described using the propositions of classical logic. It is therefore necessary to have a formal framework suited to the propositions describing quantum phenomena. In our study, we highlight the various differences between classical logic and quantum logic, examine the distributive property and discuss, from the perspective of Birkhoff and von Neumann, the algebraic structure to which quantum logic might correspond. At the conclusion of our research, we find that, in order to assert that all experimental propositions logically equivalent to a given experimental proposition constitute a physical property, the operators corresponding to the measured quantities must commute with one another. Boolean algebra has an algebraic structure that allows classical logic to be formalised. In such algebra, the distributive property holds; thus, distributivity does not pose a problem for classical logic. Consequently, the distributive property does not always hold in quantum logic and quantum systems can be modelled using orthomodular lattices associated with closed subspaces of Hilbert space. We believe that this model must evolve in parallel with the discovery of new quantum phenomena and that it provides a framework conductive to this evolution. Keywords: Quantum logic; distributivity; partially order sets (posets); lattice; orthomodular lattice; Hilbert space; Boolean algebra.
The thesis investigates the possibility of a classical semantics for quantum propositional structures. A classical semantics is defined as a set of mappings each of which is (i) bivalent, i.e., the value 1 (true) or 0 (false) is assigned to each proposition, and (ii) truth-functional, i.e., the logical operations are preserved. In addition, this set must be "full", i.e., any pair of distinct propositions is assigned different values by some mapping in the set. When the propositions make assertions about the properties of classical or of quantum systems, the mappings should also be (iii) "state-induced", i.e., values assigned by the semantics should accord with values assigned by classical or by quantum mechanics. In classical propositional logic, (equivalence classes of) propositions form a Boolean algebra, and each semantic mapping assigns the value 1 to the members of a certain subset of the algebra, namely, an ultrafilter, and assigns 0 to the members of the dual ultraideal, where the union of these two subsets is the entire algebra. The propositional structures of classical mechanics are likewise Boolean algebras, so one can straightforwardly provide a classical semantics, which also satisfies (iii). However, quantum propositional structures are non-Boolean, so it is an open question whether a semantics satisfying (i), (ii) and (iii) can be provided. Von Neumann first proposed (1932) that the algebraic structures of the subspaces (or projectors) of Hilbert space be regarded as the pro-positional structures PQM of quantum mechanics. These structures have been formalized in two ways: as orthomodular lattices which have the binary operations "and", "or", defined among all elements, compatible [symbol omitted] and incompatible [symbol omitted]; and as partial-Boolean algebras which have the binary operations defined among only compatible elements. In the thesis, two basic senses in which these structures are non-Boolean are discriminated. And two notions of truth-functionality are distinguished: truth-functionality [symbols omitted] applicable to the PQM lattices; and truth-functionality [symbol omitted] applicable to both the lattices and partial-Boolean algebras. Then it is shown how the lattice definitions of "and", "or", among incompatibles rule out a bivalent, truth-functional [symbols omitted] semantics for any lattice containing incompatible, elements. In contrast, the Gleason and Kochen-Specker proofs of the impossibility of hidden-variables for quantum mechanics show the impossibility of a bivalent, truth-functional [symbol omitted] semantics for three-or-higher dimensional Hilbert space structures; and the presence of incompatible elements is necessary but is not sufficient to rule out such a semantics. As for (iii), each quantum state-induced expectation-function on a PQM truth-functionally assigns 1 and 0 values to the elements in a ultrafilter and dual ultraideal of PQM³ where, in general the union of an ultrafilter and its dual ultraideal is smaller than the entire structure. Thus it is argued that each expectation-function is the quantum analog of a classical semantic mapping, even though the domain where each expectation-function is bivalent and truth-functional is usually a non-Boolean substructure of PQM. The final portion of the thesis surveys proposals for the introduction of hidden variables into quantum mechanics, proofs of the impossibility of such hidden-variable proposals, and criticisms of these impossibility proofs. And arguments in favour of the partial-Boolean algebra, rather than the orthomodular lattice, formalization of the quantum propositional structures are reviewed.
In order to establish the object language of quantum physics, we begin with a quantum mechanical system S (atom, nucleus, elementary particle) and consider propositions A,B,… about this system S which can be proved or disproved by measuring processes. These propositions will be called elementary propositions. We will assume here that elementary propositions are value definite, i.e.,there always exists an experimental testing procedure which decides between truth and falsity of the respective proposition. The logical connectives A ∧ B (A and B), A ∨ B (A or B), A → B (A then B) and ┐ A (not A) will be defined by means of dialogs. A dialog is a formalized kind of discussion between two participants, the proponent P who asserts a certain proposition and the opponent 0 who attempts to refute it.