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

Springer eBooks

On Propositions and Physical System

Bernard d’Espagnat

Published Jan 1, 1977• 0 citations
Publisher
DOI
10.1007/978-94-010-1196-9_8

Related papers

Physical Propositions and Quantum Languages

Claudio Garola

arXiv:quant-ph/0611227•International Journal of Theoretical Physics•May 23, 2007•8 citations

The Structure of the Propositional Calculus of a Physical Theory

Franz W. Kamber

Springer eBooks•Jan 1, 1975•3 citations

Mathematical undecidability and quantum randomness

Tomasz Paterek, Časlav Brukner, Robert Prevedel +4 more

We propose a new link between mathematical undecidability and quantum physics. We demonstrate that the states of elementary quantum systems are capable of encoding mathematical axioms and show that quantum measurements are capable of revealing whether a given proposition is decidable or not within the axiomatic system. Whenever a mathematical proposition is undecidable within the axioms encoded in the state, the measurement associated with the proposition gives random outcomes. Our results support the view that quantum randomness is irreducible and a manifestation of mathematical undecidability. Whenever a proposition and a given set of axioms together contain more information than the axioms themselves, the proposition can neither be proved nor disproved from the axioms { it is mathematically undecidable [1, 2]. Here we propose a novel link between mathematical undecidability and quantum physics. We demonstrate that the states of elementary quantum systems are capable of encoding mathematical axioms. Quantum mechanics imposes an upper limit on how much information can be encoded in a quantum state [3, 4], thus limiting the information content of the set of axioms. We show that quantum measurements are capable of revealing whether a given proposition is decidable or not. Whenever a mathematical proposition is undecidable within the system of axioms encoded in the state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of mathematical undecidability by realizing in the laboratory both the actual quantum states and the required quantum measurements. (To illustrate these ideas, we conducted experiments using the polarization of photons.) Our results support the view that quantum randomness is irreducible [5, 6] and a manifestation of mathematical undecidability. Any formal system is based on axioms, which are propositions that are dened to be true. A proposition is logically independent from a given set of axioms if it can neither be proved nor disproved from the axioms. If a proposition is independent from the axioms, neither the proposition itself nor its negation creates an inconsistency together with the axiomatic system. ^

•Dec 1, 2008•1 citation

Propositional systems and measurements—II

K. -E. Hellwig, D. Krausser

International Journal of Theoretical Physics•Aug 1, 1974•5 citations

Propositional systems and measurements—I

K. -E. Hellwig, D. Krausser

International Journal of Theoretical Physics•Apr 1, 1974•6 citations

Direct Study of Some Principles

Bernard d’Espagnat

Knowledge of the classical and nonclassical theories of logical propositions is not required for an understanding of the analysis of the nonseparability of systems. Some very elementary notions about that matter may help to place the general problem in appropriate perspective. Classically, physical propositions bear upon physical systems. A proposition a bearing on a system S is a qualitative statement about S. The quantum calculus of propositions has been successfully used as an alternative and more general basis for the foundations of quantum mechanics. It is a truism that the advent of the modern physical theories—relativity, quantum mechanics, quantum electrodynamics, S matrix theory, and so on—has induced us to abandon many familiar intuitive concepts. All the successful theories mentioned above are built on elaborate sets of axioms that are justified only a posteriori, that is, by agreement between some of their consequences and observed facts.

CRC Press eBooks•Mar 5, 2018•0 citations
We propose a new link between mathematical undecidability and quantum physics. We demonstrate that the states of elementary quantum systems are capable of encoding mathematical axioms and show that quantum measurements are capable of revealing whether a given proposition is decidable or not within the axiomatic system. Whenever a mathematical proposition is undecidable within the axioms encoded in the state, the measurement associated with the proposition gives random outcomes. Our results support the view that quantum randomness is irreducible and a manifestation of mathematical undecidability. Whenever a proposition and a given set of axioms together contain more information than the axioms themselves, the proposition can neither be proved nor disproved from the axioms { it is mathematically undecidable [1, 2]. Here we propose a novel link between mathematical undecidability and quantum physics. We demonstrate that the states of elementary quantum systems are capable of encoding mathematical axioms. Quantum mechanics imposes an upper limit on how much information can be encoded in a quantum state [3, 4], thus limiting the information content of the set of axioms. We show that quantum measurements are capable of revealing whether a given proposition is decidable or not. Whenever a mathematical proposition is undecidable within the system of axioms encoded in the state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of mathematical undecidability by realizing in the laboratory both the actual quantum states and the required quantum measurements. (To illustrate these ideas, we conducted experiments using the polarization of photons.) Our results support the view that quantum randomness is irreducible [5, 6] and a manifestation of mathematical undecidability. Any formal system is based on axioms, which are propositions that are dened to be true. A proposition is logically independent from a given set of axioms if it can neither be proved nor disproved from the axioms. If a proposition is independent from the axioms, neither the proposition itself nor its negation creates an inconsistency together with the axiomatic system. ^
Knowledge of the classical and nonclassical theories of logical propositions is not required for an understanding of the analysis of the nonseparability of systems. Some very elementary notions about that matter may help to place the general problem in appropriate perspective. Classically, physical propositions bear upon physical systems. A proposition a bearing on a system S is a qualitative statement about S. The quantum calculus of propositions has been successfully used as an alternative and more general basis for the foundations of quantum mechanics. It is a truism that the advent of the modern physical theories—relativity, quantum mechanics, quantum electrodynamics, S matrix theory, and so on—has induced us to abandon many familiar intuitive concepts. All the successful theories mentioned above are built on elaborate sets of axioms that are justified only a posteriori, that is, by agreement between some of their consequences and observed facts.