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

Probabilities on a Heyting Algebra

Jean‐Pascal Laedermann

Published Sep 30, 2024• 0 citations
Publisher

Abstract

Probability is initially defined on a Boolean algebra or a lattice of projectors. We propose here to start from a Heyting algebra.
DOI
10.20944/preprints202409.2215.v1

Related papers

Probability Theory on the Lattice of Projections in a Hilbert Space

Kalyanapuram Rangachari Parthasarathy

In classical probability theory one assumes that all the events concerning a statistical experiment constitute a Boolean σ-algebra and defines a probability measure as a completely additive non-negative function which assigns the value unity for the identity element of the σ-algebra. Invariably, the σ-algebra is the Borel σ-algebra \( \mathcal{B} \) X (i.e., the smallest σ-algebra generated by the open subsets) of a nice topological space X. Under very general conditions it turns out that all probability measures on \( \mathcal{B} \) X constitute a convex set whose extreme points are degenerate probability measures.

Texts and readings in mathematics•Jan 1, 2005•0 citations

Faux-boolean algebras, classical probability, and determinism

W. Michael Dickson

Foundations of Physics Letters•Jun 1, 1995•26 citations

The complete Heyting algebra of subsystems and contextuality

Apostol Vourdas

The finite set of subsystems of a finite quantum system with variables in ${\mathbb {Z}}(n)$Z(n), is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more general concept than superposition. Consequently, the quantum probabilities related to commuting projectors in the subsystems, are incompatible with associativity of the join in the Heyting algebra, unless if the variables belong to the same chain. This leads to contextuality, which in the present formalism has as contexts, the chains in the Heyting algebra. Logical Bell inequalities, which contain “Heyting factors,” are discussed. The formalism is also applied to the infinite set of all finite quantum systems, which is appropriately enlarged in order to become a complete Heyting algebra.

arXiv:1310.3604•Journal of Mathematical Physics•Aug 1, 2013•16 citations

Gödel ≡ Bell ≡ Kochen–Specker — Gödel's Quantum Shadow Is Contextuality and Non-Locality; Bell's Logical Shadow Is Self-Reference — An Equivalence Revealing Einstein's Nemesis 95 Years Overdue

Christian Franchi Viceré

I prove three things, with two of them now formalised in machine-checked Lean 4. (i) The syntactic topos T_T of any consistent first-order theory T ⊇ PA and the Bohr topos T_A of any unital C*-algebra with dim H ≥ 3 both belong to the 2-category of topoi with non-trivial Heyting subobject classifier, and that in every object of this 2-category no weakly point-surjective map A → ΩA exists — Theorem A (Universal Lawvere Obstruction) [⊢]. (ii) Both bridge conjectures D (Bohr–Lawvere) and E (Arithmetic–Lawvere), open in v3, are now resolved at the abstract structural level with kernel-verified Lean 4 certificates (Appendices C, D, H). The underlying abstract universe structures HeytingArithUniverse and BohrLikeUniverse are isomorphic Lean structures up to renaming (Appendix E), establishing not just shared substrate but structural identity at the categorical level. (iii) — the heavy claim, made explicit for the first time: the algebra of truth values in quantum mechanics is not the Boolean algebra implicit in Kolmogorov probability, and Bell's 1964 theorem is precisely the proof of this. Quantum mechanics has been computing |⟨ψ|φ⟩|² ∈ [0,1]Heyting for ninety years, then silently applying the operator σ: LHeyting → LBoolean that collapses Heyting truth to a {0,1}-valued classical answer, and calling the result probability. The three CHSH bounds — |S| ≤ 2 (classical/Boolean), |S| ≤ 2√2 (Tsirelson/Heyting), |S| ≤ 4 (algebraic max/no-signalling) — are the three lattices read at the same scale, with experimental data (Aspect 1982, Hensen 2015, 2022 Nobel committee citation) confirming nature respects the Heyting bound. Coletti and Scozzafava's 2002 Probabilistic Logic in a Coherent Setting derived independently, from purely logical foundations, a theory of probability that does not require the outcome space to carry a Boolean algebra. This paper joins that line at its categorical destination. The triple — Gödel, Bell, Kochen–Specker — constitutes the categorical nemesis of the EPR–Hilbert programme. With Theorem A and the resolutions of D and E, the three are now formally instances of one theorem; with §11, the experimental and methodological consequence is made explicit: quantum probability has never been a measure on a Boolean σ-algebra, and the next century of foundational physics has to compute in the right algebra. Companion repository: Brahman/Muons/Gödel-Bell_equivalence — 16 files including kernel-verified Lean 4 certificates, Wolfram Mathematica numerical verification, Python exhaustive enumeration, MASTER_CERTIFICATE.json with cryptographic provenance. ORCID: 0009-0001-8974-4991

•May 13, 2026•0 citations

Quantum Probability and Quantum Information Theory

Hans Maassen

This is an introductory course on quantum probability and quantum information, based on matrix algebras.

quant-pharXiv:2607.03295•Lecture notes in physics•Jul 6, 2026•28 citations

Classical and Quantum Probability

Harish Parthasarathy

Classical probability spaces:

CRC Press eBooks•Sep 14, 2022•0 citations
In classical probability theory one assumes that all the events concerning a statistical experiment constitute a Boolean σ-algebra and defines a probability measure as a completely additive non-negative function which assigns the value unity for the identity element of the σ-algebra. Invariably, the σ-algebra is the Borel σ-algebra B \mathcal{B} B X (i.e., the smallest σ-algebra generated by the open subsets) of a nice topological space X. Under very general conditions it turns out that all probability measures on B \mathcal{B} B X constitute a convex set whose extreme points are degenerate probability measures.
The finite set of subsystems of a finite quantum system with variables in Z(n){\mathbb {Z}}(n)Z(n)Z(n), is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more general concept than superposition. Consequently, the quantum probabilities related to commuting projectors in the subsystems, are incompatible with associativity of the join in the Heyting algebra, unless if the variables belong to the same chain. This leads to contextuality, which in the present formalism has as contexts, the chains in the Heyting algebra. Logical Bell inequalities, which contain “Heyting factors,” are discussed. The formalism is also applied to the infinite set of all finite quantum systems, which is appropriately enlarged in order to become a complete Heyting algebra.
I prove three things, with two of them now formalised in machine-checked Lean 4. (i) The syntactic topos T_T of any consistent first-order theory T ⊇ PA and the Bohr topos T_A of any unital C*-algebra with dim H ≥ 3 both belong to the 2-category of topoi with non-trivial Heyting subobject classifier, and that in every object of this 2-category no weakly point-surjective map A → ΩA exists — Theorem A (Universal Lawvere Obstruction) [⊢]. (ii) Both bridge conjectures D (Bohr–Lawvere) and E (Arithmetic–Lawvere), open in v3, are now resolved at the abstract structural level with kernel-verified Lean 4 certificates (Appendices C, D, H). The underlying abstract universe structures HeytingArithUniverse and BohrLikeUniverse are isomorphic Lean structures up to renaming (Appendix E), establishing not just shared substrate but structural identity at the categorical level. (iii) — the heavy claim, made explicit for the first time: the algebra of truth values in quantum mechanics is not the Boolean algebra implicit in Kolmogorov probability, and Bell's 1964 theorem is precisely the proof of this. Quantum mechanics has been computing |⟨ψ|φ⟩|² ∈ [0,1]Heyting for ninety years, then silently applying the operator σ: LHeyting → LBoolean that collapses Heyting truth to a {0,1}-valued classical answer, and calling the result probability. The three CHSH bounds — |S| ≤ 2 (classical/Boolean), |S| ≤ 2√2 (Tsirelson/Heyting), |S| ≤ 4 (algebraic max/no-signalling) — are the three lattices read at the same scale, with experimental data (Aspect 1982, Hensen 2015, 2022 Nobel committee citation) confirming nature respects the Heyting bound. Coletti and Scozzafava's 2002 Probabilistic Logic in a Coherent Setting derived independently, from purely logical foundations, a theory of probability that does not require the outcome space to carry a Boolean algebra. This paper joins that line at its categorical destination. The triple — Gödel, Bell, Kochen–Specker — constitutes the categorical nemesis of the EPR–Hilbert programme. With Theorem A and the resolutions of D and E, the three are now formally instances of one theorem; with §11, the experimental and methodological consequence is made explicit: quantum probability has never been a measure on a Boolean σ-algebra, and the next century of foundational physics has to compute in the right algebra. Companion repository: Brahman/Muons/Gödel-Bell_equivalence — 16 files including kernel-verified Lean 4 certificates, Wolfram Mathematica numerical verification, Python exhaustive enumeration, MASTER_CERTIFICATE.json with cryptographic provenance. ORCID: 0009-0001-8974-4991