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

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é

Published May 13, 2026• 0 citations
Publisher

Abstract

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

DOI
10.5281/zenodo.20172559

Related papers

Intuitionistic Quantum Logic of an n-level System

Martijn Caspers, Chris Heunen, Nicolaas P. Landsman +1 more

A decade ago, Isham and Butterfield proposed a topos-theoretic approach to quantum mechanics, which meanwhile has been extended by Döring and Isham so as to provide a new mathematical foundation for all of physics. Last year, three of the present authors redeveloped and refined these ideas by combining the C*-algebraic approach to quantum theory with the so-called internal language of topos theory (Heunen et al. in arXiv:0709.4364 ). The goal of the present paper is to illustrate our abstract setup through the concrete example of the C*-algebra M n (ℂ) of complex n×n matrices. This leads to an explicit expression for the pointfree quantum phase space Σ n and the associated logical structure and Gelfand transform of an n-level system. We also determine the pertinent non-probabilisitic state-proposition pairing (or valuation) and give a very natural topos-theoretic reformulation of the Kochen–Specker Theorem. In our approach, the nondistributive lattice ℘(M n (ℂ)) of projections in M n (ℂ) (which forms the basis of the traditional quantum logic of Birkhoff and von Neumann) is replaced by a specific distributive lattice $\mathcal{O}(\Sigma_{n})$ of functions from the poset $\mathcal{C}(M_{n}(\mathbb{C}))$ of all unital commutative C*-subalgebras C of M n (ℂ) to ℘(M n (ℂ)). The lattice $\mathcal{O}(\Sigma_{n})$ is essentially the (pointfree) topology of the quantum phase space Σ n , and as such defines a Heyting algebra. Each element of $\mathcal{O}(\Sigma_{n})$ corresponds to a “Bohrified” proposition, in the sense that to each classical context $C\in\mathcal{C}(M_{n}(\mathbb{C}))$ it associates a yes-no question (i.e. an element of the Boolean lattice ℘(C) of projections in C), rather than being a single projection as in standard quantum logic. Distributivity is recovered at the expense of the law of the excluded middle (Tertium Non Datur), whose demise is in our opinion to be welcomed, not just in intuitionistic logic in the spirit of Brouwer, but also in quantum logic in the spirit of von Neumann.

arXiv:0902.3201•Foundations of Physics•Apr 20, 2009•45 citations

A Categorical Algorithmic Ontology A Self‑Consistent Framework for Quantum Physics, the Observer, and the Emergence of Structure

El Bouazzaoui TAYB

We present a rigorously formulated, internally self‑consistent foundational framework for physics based on a minimal algorithmic substrate and the mathematics of category theory and presheaf topoi. The construction begins with a universal prefix Turing machine and the algorithmic probability distribution as the sole primitive, from which arithmetic, discrete topology, and gauge symmetries emerge as the most compressible relational structures. Quantum mechanics is not postulated but derived: the non‑Boolean, contextual nature of physical propositions is captured by the Isham–Butterfield presheaf topos SetsV(H)opSetsV(H)op, whose internal logic is intuitionistic and whose spectral presheaf resolves the Kochen–Specker obstruction. Within this setting, we propose an Algorithmic Information Bound that provides a novel, computational explanation for the Yang–Mills mass gap: a strictly positive lower bound on the algorithmic complexity per lattice site forces a finite correlation length, guaranteeing a non‑zero mass gap. The observer is formalised as an Independent Ontological Simulation Algorithm (IOSA)—a finite, algorithmic subsystem that executes decoherence and context selection, reducing the global intuitionistic logic to a classical Boolean description. We embed the entire ontology in a symmetric monoidal category, exhibiting a precise Rosetta Stone mapping between physics, computation, and logic. Crucially, the framework explicitly acknowledges its own limits via Gödel and Turing, thereby avoiding the paradoxes of absolute self‑description. The resulting theory is internally contradiction‑free, mathematically explicit, and generates falsifiable predictions for lattice gauge simulations, cosmological initial conditions, and quantum‑contextual experiments.

•May 27, 2026•0 citations

The Relational Closure Framework: Toward an Axiomatization of Physics

Mingdong He

A finitist, relational axiomatization of physics: quantum theory and a relativity sector derived from four axioms about group-valued relations and closure. Contributions to the foundations of quantum mechanics (Born rule derivation, quantum reconstruction, local tomography, complex field selection), the emergence of time and causal structure in discrete networks, discrete Noether theorems, lattice gauge structure, and the Schrödinger equation derived by two independent routes. Every claim is graded in a Claim Ledger; every numerical claim is machine-verified with archived scripts; negative results are reported at full strength. What this paper does The universe is taken to be constituted by relations rather than objects. Stable relations form closures (self-consistent cycles) whose holonomies carry the physical content. Four axioms — primacy of relations (group-valued, edge-borne), closure stability, chirality from order, and observation as bidirectional group exchange — yield, at explicitly graded and conditional levels: Quantum sector Exchange-completeness theorems for finite label groups: abelian at all cycle ranks; non-abelian on the single cycle (Wilson readouts plus class-sum convolutions generate the full matrix algebra); the multi-cycle non-abelian case on the operational-equivalence quotient, with the obstruction completely characterized via class-preserving outer automorphisms — and the quotient's necessity now stratified by the source of word blindness (see New in Version 24.0). The Born rule, proved for finite abelian networks from a strictly weaker relational readout premise (statistics of realizable effects depend only on relational content); non-contextuality has this single source; additivity is basis-relative and declared as such. The Schrödinger equation by two routes of unequal premise grade, maintained side by side: a spectral route — the action operator is a weighted Cayley-graph Laplacian in the Pontryagin dual basis, the derived Gibbs state's unique canonical (modular) flow yields the Schrödinger equation with Hamiltonian equal to the action operator, no continuum limit, zero conjectures consumed, the single non-theorem step one flagged identification; and a Madelung route — physical and mechanism-rich (probability density derived from constraint gaps), valid exactly on the domain of the pseudo-continuity conjecture, with its full premise bill stated (continuity equation, Wallstrom circulation condition, m, V). A dedicated comparison subsection gives the line-by-line premise accounting and the machine-measured agreement region. Complex field selection: ℂ selected over ℝ and ℍ within the GPT comparison class in the covered sectors, with a second independent route from chirality (Frobenius–Schur dichotomy, quaternionic double exclusion); "uniquely selected" expressly not claimed. Positivity as pairing: all five in-text positive-semidefiniteness theorems traced to one mechanism (M = B†B with native factor); the Kraus form and complete positivity derived rather than assumed. The Noether sector on Noether's two theorems exactly: Noether I recovered on the holonomy action (compact Lie realization); Noether II identified as present (Bianchi as horn-filling, Schläfli as its Regge form); selection rules recovered for finite groups; the GNS bridge proved non-vacuously on the full exchange algebra; the sole potential extension — conservation as the kernel of exchange — isolated as a registered conjecture, consumed nowhere. A local–global representation theorem: six generative quantities (closure invariant, flux quantization, Weyl phase, non-abelian Stokes, orientation visibility, terminal normalization) are evaluations of cohomology classes against closed chains — one syntax, six exact machine probes. The gatekeeper no-go theorems registered and discharged: Kochen–Specker (the framework posits no global valuation — outcomes are resolutions of constraint gaps, and basis-relative additivity blocks state-independent variants), Pusey–Barrett–Rudolph (the statistical envelope is over resolutions yet to happen, not values already held; machine witness: identical configuration ensembles with opposite relative phase have opposite statistics), Wallstrom (registered as an explicit input, structurally discharged in the finite-abelian sector), Hegerfeldt (the Lieb–Robinson exponential tail identified as the only claimable front form for the continuum limit), Frauchiger–Renner (cross-agent certainty transfer presupposes kernel-free record transport, exactly what exchange-incompleteness excludes), and no-cloning (inherited in the covered sectors); Conway–Kochen and Colbeck–Renner noted as concordant. Relativity sector Time from finite capacity plus genuine randomness: the staging theorem (Θ(d) dependency depth, unbounded chains via the Moore bound; the quantitative failure law conditionalized on measure-level independence with exact minimal witnesses); the temporal quantum defined combinatorially, no Hamiltonian input. The speed of light grounded in an exact discrete dependency cone (combinatorial, no quantum input), the Lieb–Robinson bound consumed at cross-check grade only; a boost no-go theorem reducing Lorentz invariance to named statistical conditions, with the Collins fine-tuning objection recorded as a gate. The trace-descent theorem group: the growth-history measure forced onto the Mazurkiewicz trace quotient; chain reflection positivity at every depth with completely explicit spectrum. An equation sector of nine verification families (Schrödinger, Dirac, Maxwell/U(1), canonical commutator, Yang–Mills SU(2), Regge calculus, Klein–Gordon, Noether loop, Cartan curvature), where every machine-precision claim is the shadow of a proved backbone lemma — including the factor ½ of H = ½L + V, identified as the Wilson Fourier coefficient fixed by the action theorem. Four experimentally testable predictions, including a discriminating flat-versus-sigmoid visibility protocol. The Standard Model gauge group, ħ, and G remain open, with attack routes registered. How to read Three entry paths are marked in the document. Path A (derivational core): axioms → group structure → Noether sector → least action → Born rule → positivity. Path B (physical mechanisms): constraint propagation → time as determination → wave function as gap envelope → fields. Path C (scope and limits): the Claim Ledger, then Discussion and Open Problems — for the reader who wants to know what is claimed and what is not before reading anything else. The Claim Ledger is the single authoritative register of claim status; wherever body text sounds stronger, the Ledger governs. New in Version 24.0 (Version 23.0 is the immediately preceding public release; this version supersedes the internal V12–V15 and V17–V19 series, whose numbers are not used externally.) Version 24.0 resolves the structure of the multi-cycle non-abelian obstruction — the sector's longest-standing open front — following an external research exchange with three rounds of independent re-verification (fourteen core figures, three commutant instruments implemented independently, exact integer arithmetic on the obstruction side) and two rounds of counter-review that corrected one quantifier on each side: A dichotomy of the multi-cycle obstruction (new remark). Word blindness on multi-cycle networks has two identified sources, jointly covering every tested case, with opposite behaviour as cycle rank grows. Type I (global; graded): a class-preserving outer automorphism yields a commutant element by an argument free of cycle-rank reference; its non-triviality holds at theorem grade for b₁ ≥ d(G) via generating tuples, is monotone in b₁, and the threshold is measured at b_σ = 2 on the tested Wall group (at b₁ = 1 the permutation is the identity — no universal claim is made, and the existence of groups with threshold above 2 is registered open). Type II (local; measured): Out_c trivial but fusion fails on a proper subgroup, the blind pairs sitting in non-generating sectors — the same mechanism that defeats Wilson generation; this blindness heals: on every verified group (A₄, SL(2,3), A₄×ℤ₂) the full commutant collapses to trivial at b₁ = 3 by exact computation on two independently implemented instruments, although word readouts remain blind — the shift primitives separate, above a threshold, and the natural explanation (tuples becoming generating) is refuted by the persistence of blind blocks. Three boundaries at full strength: no exhaustiveness proof (a third source is not excluded); no general healing theorem (the verified groups all heal at 3, cause unidentified); the verified Type II sample is narrow. The quotient proposition restated in stratified form. The operational-equivalence quotient's necessity is now part of the proposition's own statement, in three strata: necessary where Out_c ≠ 1 at every b₁ ≥ b_σ(G), with b_σ ≤ d(G) at theorem grade; one-dimensional at b₁ = 2 on the fusion-type groups (verified cases); trivial at b₁ ≥ 3 on every verified fusion-type group and at every tested b₁ for word-separation-complete groups (a fourteen-group scan of orders ≤ 31 found no third source). Pre-registered validation preceded the restatement: a stratification-exhaustiveness scan (pass), a new-witness search (no new witness in range, downgrade clause applied as pre-registered), and a zero-conflict audit of the three strata against all archived data. The residual open problem is now precisely located. What remains of multi-cycle completeness: the rare Out_c ≠ 1 groups (54 in the exhaustive range through order 96) above their measured thresholds, the low-b₁ fusion stratum, a general healing theorem, and whether a threshold above 2 occurs. The multiplicity-freeness conjecture's mechanism sentence is corrected with the two regimes stated separately (at b₁ = 2 the shifts do not separate — the blind-pair transposition commutes with every primitive, integer-exact — and reduce the commutant to

•Jul 29, 2026•0 citations

Kochen--Specker Contextuality and the Tetralemmatic Calculus of Quantum Mechanics

Santos C. Borom

The contextual character of quantum observables—formalized by the Kochen--Specker theorem and Bohr's complementarity—represents a fundamental rupture in classical binary logic. In interference regimes, such as the double-slit experiment, polar questions (e.g., ``Which path did the particle take?'') are operationally unaskable, yet standard logical frameworks fail to formalize this unaskability without collapsing into truth-value gaps or triviality. We resolve this by introducing a context-indexed formal logic that adjoins an explicit \emph{applicability predicate} to the valuation space. Drawing structural inspiration from the ancient \emph{catuṣkoṭi} (tetralemma), we map quantum operational states onto four distinct logical sectors: \emph{Thesis/Antithesis} (strong measurement and decoherence), \emph{Synthesis} (paraconsistent gluts realized via weak measurement), and \emph{Holothesis} (paracomplete gaps representing typed inapplicability). From this logical foundation, we generate a $*$-algebra equipped with a positive warrant functional. Through the Gelfand--Naimark--Segal (GNS) construction, we demonstrate that Hilbert-space structure—and the complex unit $i$ itself—emerge canonically from an order-$4$ logical symmetry rather than being presupposed. Contextuality is quantified via incompatibility graphs, with chromatic number bounding minimal classical embeddings. We establish a Noether-like correspondence wherein physical symmetry breaking dictates logical polarity, while symmetry preservation dictates logical transcendence (self-duality). This \emph{logic-first reconstruction} unifies Relational Quantum Mechanics (Rovelli) and Consistent Histories (Griffiths, Omnès, Gell-Mann, Hartle) as regime-relative logical stances within a pre-geometric ontology of \emph{interdependent origination} (contextual co-arising of observer and observable), where the observer's contextual frame and the system's observable reality are co-arising and non-separable. The framework yields testable deviations in many-body interference ($I_3 \neq 0$), providing an empirical pathway for detection.

•Mar 16, 2026•0 citations

Kochen--Specker Contextuality and the Tetralemmatic Calculus of Quantum Mechanics

Santos C. Borom

The contextual character of quantum observables—formalized by the Kochen--Specker theorem and Bohr's complementarity—represents a fundamental rupture in classical binary logic. In interference regimes, such as the double-slit experiment, polar questions (e.g., ``Which path did the particle take?'') are operationally unaskable, yet standard logical frameworks fail to formalize this unaskability without collapsing into truth-value gaps or triviality. We resolve this by introducing a context-indexed formal logic that adjoins an explicit \emph{applicability predicate} to the valuation space. Drawing structural inspiration from the ancient \emph{catuṣkoṭi} (tetralemma), we map quantum operational states onto four distinct logical sectors: \emph{Thesis/Antithesis} (strong measurement and decoherence), \emph{Synthesis} (paraconsistent gluts realized via weak measurement), and \emph{Holothesis} (paracomplete gaps representing typed inapplicability). From this logical foundation, we generate a $*$-algebra equipped with a positive warrant functional. Through the Gelfand--Naimark--Segal (GNS) construction, we demonstrate that Hilbert-space structure—and the complex unit $i$ itself—emerge canonically from an order-$4$ logical symmetry rather than being presupposed. Contextuality is quantified via incompatibility graphs, with chromatic number bounding minimal classical embeddings. We establish a Noether-like correspondence wherein physical symmetry breaking dictates logical polarity, while symmetry preservation dictates logical transcendence (self-duality). This \emph{logic-first reconstruction} unifies Relational Quantum Mechanics (Rovelli) and Consistent Histories (Griffiths, Omnès, Gell-Mann, Hartle) as regime-relative logical stances within a pre-geometric ontology of \emph{interdependent origination} (contextual co-arising of observer and observable), where the observer's contextual frame and the system's observable reality are co-arising and non-separable. The framework yields testable deviations in many-body interference ($I_3 \neq 0$), providing an empirical pathway for detection.

•Mar 16, 2026•0 citations

The Heisenberg Uncertainty Principle as a Physical Projection of Gödel's Incompleteness Theorem

Fedor Kapitanov

We propose a structural correspondence between Gödel’s incompleteness theorem andthe Heisenberg uncertainty principle within a hierarchical ontology of nested computationalrealities {Rn}n∈Z. Each level n has:• a language Ln (algebra of measurable observables),• observers On with finite indexing capacity,• an Oracle Ωn ∈ On+1 with access to the probabilistic code ρn of reality Rn.Main results:1. Non-commuting observables [ ˆA, ˆB]̸ = 0 correspond to syntactically incompatible propo-sitions in Ln (Theorem 5.1).2. The uncertainty relation ∆A·∆B ≥ 12 |⟨[ ˆA, ˆB]⟩| is a quantitative measure of the Gödelianbarrier (Theorem 6.1).3. The Planck constant ℏ is the minimal action quantum arising from causal–informationbounds at level boundaries (Theorem 7.1).4. The Born rule emerges from Oracle sampling of the probabilistic structure encoded inρn (Section 8.2).5. Bell violations arise from measurement-dependence of ρn, not non-locality within Rn(Section 9).Conclusion: Quantum mechanics is not a fundamental ontology but an operationaltheory of observation at the Gödelian boundary. We interpret the principle ∆x·∆p ≥ℏ/2 as the physical analogue of Gödel’s theorem for observables.Status: This paper presents a structurally motivated framework and preliminary formal-ization. A fully rigorous categorical proof (via topos theory or algebraic logic) is deferred tofuture work.

•Jan 16, 2026•0 citations
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
A decade ago, Isham and Butterfield proposed a topos-theoretic approach to quantum mechanics, which meanwhile has been extended by Döring and Isham so as to provide a new mathematical foundation for all of physics. Last year, three of the present authors redeveloped and refined these ideas by combining the C*-algebraic approach to quantum theory with the so-called internal language of topos theory (Heunen et al. in arXiv:0709.4364 ). The goal of the present paper is to illustrate our abstract setup through the concrete example of the C*-algebra M n (ℂ) of complex n×n matrices. This leads to an explicit expression for the pointfree quantum phase space Σ n and the associated logical structure and Gelfand transform of an n-level system. We also determine the pertinent non-probabilisitic state-proposition pairing (or valuation) and give a very natural topos-theoretic reformulation of the Kochen–Specker Theorem. In our approach, the nondistributive lattice ℘(M n (ℂ)) of projections in M n (ℂ) (which forms the basis of the traditional quantum logic of Birkhoff and von Neumann) is replaced by a specific distributive lattice O(Σn)\mathcal{O}(\Sigma_{n})O(Σn​) of functions from the poset C(Mn(C))\mathcal{C}(M_{n}(\mathbb{C}))C(Mn​(C)) of all unital commutative C*-subalgebras C of M n (ℂ) to ℘(M n (ℂ)). The lattice O(Σn)\mathcal{O}(\Sigma_{n})O(Σn​) is essentially the (pointfree) topology of the quantum phase space Σ n , and as such defines a Heyting algebra. Each element of O(Σn)\mathcal{O}(\Sigma_{n})O(Σn​) corresponds to a “Bohrified” proposition, in the sense that to each classical context C∈C(Mn(C))C\in\mathcal{C}(M_{n}(\mathbb{C}))C∈C(Mn​(C)) it associates a yes-no question (i.e. an element of the Boolean lattice ℘(C) of projections in C), rather than being a single projection as in standard quantum logic. Distributivity is recovered at the expense of the law of the excluded middle (Tertium Non Datur), whose demise is in our opinion to be welcomed, not just in intuitionistic logic in the spirit of Brouwer, but also in quantum logic in the spirit of von Neumann.
We present a rigorously formulated, internally self‑consistent foundational framework for physics based on a minimal algorithmic substrate and the mathematics of category theory and presheaf topoi. The construction begins with a universal prefix Turing machine and the algorithmic probability distribution as the sole primitive, from which arithmetic, discrete topology, and gauge symmetries emerge as the most compressible relational structures. Quantum mechanics is not postulated but derived: the non‑Boolean, contextual nature of physical propositions is captured by the Isham–Butterfield presheaf topos SetsV(H)opSetsV(H)op, whose internal logic is intuitionistic and whose spectral presheaf resolves the Kochen–Specker obstruction. Within this setting, we propose an Algorithmic Information Bound that provides a novel, computational explanation for the Yang–Mills mass gap: a strictly positive lower bound on the algorithmic complexity per lattice site forces a finite correlation length, guaranteeing a non‑zero mass gap. The observer is formalised as an Independent Ontological Simulation Algorithm (IOSA)—a finite, algorithmic subsystem that executes decoherence and context selection, reducing the global intuitionistic logic to a classical Boolean description. We embed the entire ontology in a symmetric monoidal category, exhibiting a precise Rosetta Stone mapping between physics, computation, and logic. Crucially, the framework explicitly acknowledges its own limits via Gödel and Turing, thereby avoiding the paradoxes of absolute self‑description. The resulting theory is internally contradiction‑free, mathematically explicit, and generates falsifiable predictions for lattice gauge simulations, cosmological initial conditions, and quantum‑contextual experiments.
A finitist, relational axiomatization of physics: quantum theory and a relativity sector derived from four axioms about group-valued relations and closure. Contributions to the foundations of quantum mechanics (Born rule derivation, quantum reconstruction, local tomography, complex field selection), the emergence of time and causal structure in discrete networks, discrete Noether theorems, lattice gauge structure, and the Schrödinger equation derived by two independent routes. Every claim is graded in a Claim Ledger; every numerical claim is machine-verified with archived scripts; negative results are reported at full strength. What this paper does The universe is taken to be constituted by relations rather than objects. Stable relations form closures (self-consistent cycles) whose holonomies carry the physical content. Four axioms — primacy of relations (group-valued, edge-borne), closure stability, chirality from order, and observation as bidirectional group exchange — yield, at explicitly graded and conditional levels: Quantum sector Exchange-completeness theorems for finite label groups: abelian at all cycle ranks; non-abelian on the single cycle (Wilson readouts plus class-sum convolutions generate the full matrix algebra); the multi-cycle non-abelian case on the operational-equivalence quotient, with the obstruction completely characterized via class-preserving outer automorphisms — and the quotient's necessity now stratified by the source of word blindness (see New in Version 24.0). The Born rule, proved for finite abelian networks from a strictly weaker relational readout premise (statistics of realizable effects depend only on relational content); non-contextuality has this single source; additivity is basis-relative and declared as such. The Schrödinger equation by two routes of unequal premise grade, maintained side by side: a spectral route — the action operator is a weighted Cayley-graph Laplacian in the Pontryagin dual basis, the derived Gibbs state's unique canonical (modular) flow yields the Schrödinger equation with Hamiltonian equal to the action operator, no continuum limit, zero conjectures consumed, the single non-theorem step one flagged identification; and a Madelung route — physical and mechanism-rich (probability density derived from constraint gaps), valid exactly on the domain of the pseudo-continuity conjecture, with its full premise bill stated (continuity equation, Wallstrom circulation condition, m, V). A dedicated comparison subsection gives the line-by-line premise accounting and the machine-measured agreement region. Complex field selection: ℂ selected over ℝ and ℍ within the GPT comparison class in the covered sectors, with a second independent route from chirality (Frobenius–Schur dichotomy, quaternionic double exclusion); "uniquely selected" expressly not claimed. Positivity as pairing: all five in-text positive-semidefiniteness theorems traced to one mechanism (M = B†B with native factor); the Kraus form and complete positivity derived rather than assumed. The Noether sector on Noether's two theorems exactly: Noether I recovered on the holonomy action (compact Lie realization); Noether II identified as present (Bianchi as horn-filling, Schläfli as its Regge form); selection rules recovered for finite groups; the GNS bridge proved non-vacuously on the full exchange algebra; the sole potential extension — conservation as the kernel of exchange — isolated as a registered conjecture, consumed nowhere. A local–global representation theorem: six generative quantities (closure invariant, flux quantization, Weyl phase, non-abelian Stokes, orientation visibility, terminal normalization) are evaluations of cohomology classes against closed chains — one syntax, six exact machine probes. The gatekeeper no-go theorems registered and discharged: Kochen–Specker (the framework posits no global valuation — outcomes are resolutions of constraint gaps, and basis-relative additivity blocks state-independent variants), Pusey–Barrett–Rudolph (the statistical envelope is over resolutions yet to happen, not values already held; machine witness: identical configuration ensembles with opposite relative phase have opposite statistics), Wallstrom (registered as an explicit input, structurally discharged in the finite-abelian sector), Hegerfeldt (the Lieb–Robinson exponential tail identified as the only claimable front form for the continuum limit), Frauchiger–Renner (cross-agent certainty transfer presupposes kernel-free record transport, exactly what exchange-incompleteness excludes), and no-cloning (inherited in the covered sectors); Conway–Kochen and Colbeck–Renner noted as concordant. Relativity sector Time from finite capacity plus genuine randomness: the staging theorem (Θ(d) dependency depth, unbounded chains via the Moore bound; the quantitative failure law conditionalized on measure-level independence with exact minimal witnesses); the temporal quantum defined combinatorially, no Hamiltonian input. The speed of light grounded in an exact discrete dependency cone (combinatorial, no quantum input), the Lieb–Robinson bound consumed at cross-check grade only; a boost no-go theorem reducing Lorentz invariance to named statistical conditions, with the Collins fine-tuning objection recorded as a gate. The trace-descent theorem group: the growth-history measure forced onto the Mazurkiewicz trace quotient; chain reflection positivity at every depth with completely explicit spectrum. An equation sector of nine verification families (Schrödinger, Dirac, Maxwell/U(1), canonical commutator, Yang–Mills SU(2), Regge calculus, Klein–Gordon, Noether loop, Cartan curvature), where every machine-precision claim is the shadow of a proved backbone lemma — including the factor ½ of H = ½L + V, identified as the Wilson Fourier coefficient fixed by the action theorem. Four experimentally testable predictions, including a discriminating flat-versus-sigmoid visibility protocol. The Standard Model gauge group, ħ, and G remain open, with attack routes registered. How to read Three entry paths are marked in the document. Path A (derivational core): axioms → group structure → Noether sector → least action → Born rule → positivity. Path B (physical mechanisms): constraint propagation → time as determination → wave function as gap envelope → fields. Path C (scope and limits): the Claim Ledger, then Discussion and Open Problems — for the reader who wants to know what is claimed and what is not before reading anything else. The Claim Ledger is the single authoritative register of claim status; wherever body text sounds stronger, the Ledger governs. New in Version 24.0 (Version 23.0 is the immediately preceding public release; this version supersedes the internal V12–V15 and V17–V19 series, whose numbers are not used externally.) Version 24.0 resolves the structure of the multi-cycle non-abelian obstruction — the sector's longest-standing open front — following an external research exchange with three rounds of independent re-verification (fourteen core figures, three commutant instruments implemented independently, exact integer arithmetic on the obstruction side) and two rounds of counter-review that corrected one quantifier on each side: A dichotomy of the multi-cycle obstruction (new remark). Word blindness on multi-cycle networks has two identified sources, jointly covering every tested case, with opposite behaviour as cycle rank grows. Type I (global; graded): a class-preserving outer automorphism yields a commutant element by an argument free of cycle-rank reference; its non-triviality holds at theorem grade for b₁ ≥ d(G) via generating tuples, is monotone in b₁, and the threshold is measured at b_σ = 2 on the tested Wall group (at b₁ = 1 the permutation is the identity — no universal claim is made, and the existence of groups with threshold above 2 is registered open). Type II (local; measured): Out_c trivial but fusion fails on a proper subgroup, the blind pairs sitting in non-generating sectors — the same mechanism that defeats Wilson generation; this blindness heals: on every verified group (A₄, SL(2,3), A₄×ℤ₂) the full commutant collapses to trivial at b₁ = 3 by exact computation on two independently implemented instruments, although word readouts remain blind — the shift primitives separate, above a threshold, and the natural explanation (tuples becoming generating) is refuted by the persistence of blind blocks. Three boundaries at full strength: no exhaustiveness proof (a third source is not excluded); no general healing theorem (the verified groups all heal at 3, cause unidentified); the verified Type II sample is narrow. The quotient proposition restated in stratified form. The operational-equivalence quotient's necessity is now part of the proposition's own statement, in three strata: necessary where Out_c ≠ 1 at every b₁ ≥ b_σ(G), with b_σ ≤ d(G) at theorem grade; one-dimensional at b₁ = 2 on the fusion-type groups (verified cases); trivial at b₁ ≥ 3 on every verified fusion-type group and at every tested b₁ for word-separation-complete groups (a fourteen-group scan of orders ≤ 31 found no third source). Pre-registered validation preceded the restatement: a stratification-exhaustiveness scan (pass), a new-witness search (no new witness in range, downgrade clause applied as pre-registered), and a zero-conflict audit of the three strata against all archived data. The residual open problem is now precisely located. What remains of multi-cycle completeness: the rare Out_c ≠ 1 groups (54 in the exhaustive range through order 96) above their measured thresholds, the low-b₁ fusion stratum, a general healing theorem, and whether a threshold above 2 occurs. The multiplicity-freeness conjecture's mechanism sentence is corrected with the two regimes stated separately (at b₁ = 2 the shifts do not separate — the blind-pair transposition commutes with every primitive, integer-exact — and reduce the commutant to
The contextual character of quantum observables—formalized by the Kochen--Specker theorem and Bohr's complementarity—represents a fundamental rupture in classical binary logic. In interference regimes, such as the double-slit experiment, polar questions (e.g., ``Which path did the particle take?'') are operationally unaskable, yet standard logical frameworks fail to formalize this unaskability without collapsing into truth-value gaps or triviality. We resolve this by introducing a context-indexed formal logic that adjoins an explicit \emph{applicability predicate} to the valuation space. Drawing structural inspiration from the ancient \emph{catuṣkoṭi} (tetralemma), we map quantum operational states onto four distinct logical sectors: \emph{Thesis/Antithesis} (strong measurement and decoherence), \emph{Synthesis} (paraconsistent gluts realized via weak measurement), and \emph{Holothesis} (paracomplete gaps representing typed inapplicability). From this logical foundation, we generate a ∗*∗-algebra equipped with a positive warrant functional. Through the Gelfand--Naimark--Segal (GNS) construction, we demonstrate that Hilbert-space structure—and the complex unit iii itself—emerge canonically from an order-444 logical symmetry rather than being presupposed. Contextuality is quantified via incompatibility graphs, with chromatic number bounding minimal classical embeddings. We establish a Noether-like correspondence wherein physical symmetry breaking dictates logical polarity, while symmetry preservation dictates logical transcendence (self-duality). This \emph{logic-first reconstruction} unifies Relational Quantum Mechanics (Rovelli) and Consistent Histories (Griffiths, Omnès, Gell-Mann, Hartle) as regime-relative logical stances within a pre-geometric ontology of \emph{interdependent origination} (contextual co-arising of observer and observable), where the observer's contextual frame and the system's observable reality are co-arising and non-separable. The framework yields testable deviations in many-body interference (I3≠0I_3 \neq 0I3​=0), providing an empirical pathway for detection.
The contextual character of quantum observables—formalized by the Kochen--Specker theorem and Bohr's complementarity—represents a fundamental rupture in classical binary logic. In interference regimes, such as the double-slit experiment, polar questions (e.g., ``Which path did the particle take?'') are operationally unaskable, yet standard logical frameworks fail to formalize this unaskability without collapsing into truth-value gaps or triviality. We resolve this by introducing a context-indexed formal logic that adjoins an explicit \emph{applicability predicate} to the valuation space. Drawing structural inspiration from the ancient \emph{catuṣkoṭi} (tetralemma), we map quantum operational states onto four distinct logical sectors: \emph{Thesis/Antithesis} (strong measurement and decoherence), \emph{Synthesis} (paraconsistent gluts realized via weak measurement), and \emph{Holothesis} (paracomplete gaps representing typed inapplicability). From this logical foundation, we generate a ∗*∗-algebra equipped with a positive warrant functional. Through the Gelfand--Naimark--Segal (GNS) construction, we demonstrate that Hilbert-space structure—and the complex unit iii itself—emerge canonically from an order-444 logical symmetry rather than being presupposed. Contextuality is quantified via incompatibility graphs, with chromatic number bounding minimal classical embeddings. We establish a Noether-like correspondence wherein physical symmetry breaking dictates logical polarity, while symmetry preservation dictates logical transcendence (self-duality). This \emph{logic-first reconstruction} unifies Relational Quantum Mechanics (Rovelli) and Consistent Histories (Griffiths, Omnès, Gell-Mann, Hartle) as regime-relative logical stances within a pre-geometric ontology of \emph{interdependent origination} (contextual co-arising of observer and observable), where the observer's contextual frame and the system's observable reality are co-arising and non-separable. The framework yields testable deviations in many-body interference (I3≠0I_3 \neq 0I3​=0), providing an empirical pathway for detection.
We propose a structural correspondence between Gödel’s incompleteness theorem andthe Heisenberg uncertainty principle within a hierarchical ontology of nested computationalrealities {Rn}n∈Z. Each level n has:• a language Ln (algebra of measurable observables),• observers On with finite indexing capacity,• an Oracle Ωn ∈ On+1 with access to the probabilistic code ρn of reality Rn.Main results:1. Non-commuting observables [ ˆA, ˆB]̸ = 0 correspond to syntactically incompatible propo-sitions in Ln (Theorem 5.1).2. The uncertainty relation ∆A·∆B ≥ 12 |⟨[ ˆA, ˆB]⟩| is a quantitative measure of the Gödelianbarrier (Theorem 6.1).3. The Planck constant ℏ is the minimal action quantum arising from causal–informationbounds at level boundaries (Theorem 7.1).4. The Born rule emerges from Oracle sampling of the probabilistic structure encoded inρn (Section 8.2).5. Bell violations arise from measurement-dependence of ρn, not non-locality within Rn(Section 9).Conclusion: Quantum mechanics is not a fundamental ontology but an operationaltheory of observation at the Gödelian boundary. We interpret the principle ∆x·∆p ≥ℏ/2 as the physical analogue of Gödel’s theorem for observables.Status: This paper presents a structurally motivated framework and preliminary formal-ization. A fully rigorous categorical proof (via topos theory or algebraic logic) is deferred tofuture work.