Supersession Note — May 2026 This CODES-era work is an exploratory predecessor and is no longer the canonical statement of the author’s program. It has been superseded by the identity-persistence stack: Universal Identity and Persistence: https://zenodo.org/records/19904166 A Mathematical Theory of Identity Persistence: https://zenodo.org/records/19967345 A Coding Theorem for Identity Persistence: https://zenodo.org/records/19996467 Identity Persistence Calculus: https://zenodo.org/records/19905404 The Bounded Corridor: https://zenodo.org/records/19645631 The Unclosable Bridge: https://zenodo.org/records/19601328 Claims in this record concerning replacement of probability, unrestricted universality, ontology, physics, intelligence, biology, governance, or reality should be read as developmental framing, not as the current formal claim. The current claim is restricted to identity persistence under transformation within explicit admissibility constraints: recurrence comparability, admissible redescription, bounded drift, scalar or scalar-equivalent governance, finite identity capacity, and deterministic finite-regime coding/enforcement where applicable.
Supersession Note — May 2026 This CODES-era work is an exploratory predecessor and is no longer the canonical statement of the author’s program. It has been superseded by the identity-persistence stack: Universal Identity and Persistence: https://zenodo.org/records/19904166 A Mathematical Theory of Identity Persistence: https://zenodo.org/records/19967345 A Coding Theorem for Identity Persistence: https://zenodo.org/records/19996467 Identity Persistence Calculus: https://zenodo.org/records/19905404 The Bounded Corridor: https://zenodo.org/records/19645631 The Unclosable Bridge: https://zenodo.org/records/19601328 Claims in this record concerning replacement of probability, unrestricted universality, ontology, physics, intelligence, biology, governance, or reality should be read as developmental framing, not as the current formal claim. The current claim is restricted to identity persistence under transformation within explicit admissibility constraints: recurrence comparability, admissible redescription, bounded drift, scalar or scalar-equivalent governance, finite identity capacity, and deterministic finite-regime coding/enforcement where applicable.
Supersession Note — May 2026 This CODES-era work is an exploratory predecessor and is no longer the canonical statement of the author’s program. It has been superseded by the identity-persistence stack: https://zenodo.org/records/20127331. Claims in this record concerning replacement of probability, unrestricted universality, ontology, physics, intelligence, biology, governance, or reality should be read as developmental framing, not as the current formal claim. The current claim is restricted to identity persistence under transformation within explicit admissibility constraints. Abstract: This work demonstrates that the Everett (Many-Worlds) interpretation of quantum mechanics, while claiming full unitarity, introduces irreversibility without cause. Decoherence is governed by the same unitary operator U(t) and its inverse U†(t); treating branch separation as permanent therefore imposes an unmotivated non-unitary constraint. Logical audit shows that the transition from approximate to exact orthogonality re-inserts collapse by assumption. The paper concludes that a genuinely deterministic formulation must permit lawful recoherence, consistent with Structured Resonance Dynamics.
This is the Technical Supplement — the proof-dense companion and the canonical formal record for the paper's claims. The main paper argues; the supplement proves. Every load-bearing claim traces to a named check function in the APF verification engine, and the supplement is the document a referee should audit first. The supplement is self-contained for Paper 14: every definition, proof, and grade the paper rests on appears in this one document — the substrate primitives and the marginal admissibility floor, proved; the locality and cost-uniqueness lemmas; the Δ calculus with both fences' witnesses written out; the Boolean-defender bridge with its five certified physical hypotheses and the 3-4-5 worked witness computed on the page; the gate pipeline with a gate-by-axiom comparison to the operational-reconstruction literature (Hardy; Chiribella–D'Ariano–Perinotti; Masanes–Müller; Barnum–Wilce; Spekkens; Abramsky–Brandenburger); the native correlation family constructed explicitly, rung by rung; the resolution triad set against standard thermodynamics (Landauer, erasure, environment-assisted recovery); a consolidated readings register listing every claim below [P] with its falsifier and status; a glossary mapping the framework's vocabulary onto standard quantum-information terms; and a worked end-to-end instance — device to interrogation normal form to exact feasibility certificate to priced ledger, with every tolerance explicit. A reproducibility appendix pins every claim to the APF theorem bank at a named GitHub commit and the archived Engine release (DOI 10.5281/zenodo.18529115); the certificates reproduce deterministically in exact rational arithmetic. About the series. Admissibility Physics is a structural realist reconstruction program built on a single commitment: any bounded region of the world can hold only finitely many distinctions. A principle of least enforcement cost then selects, among all the ways those distinctions might be arranged, the configurations a finite world can sustain. From this the content of physics is reconstructed rather than postulated: the Standard Model's gauge group and matter content, the Hilbert-space and Born-rule architecture of quantum mechanics, the geometry and field equations of general relativity, the four laws of thermodynamics, and the large-scale budget of cosmology emerge as different readings of one finite-capacity ledger. The unification is quantitative as well as conceptual: the framework's dimensionless constants appear not as free parameters but as counts read off that ledger — among them the dark-energy fraction ΩΛ = 42/61 and the weak mixing angle sin2θW = 3/13 — fixed, in the strongest cases, to within current measurement. The core derivation runs Papers 0–11; the extension papers carry the individual sectors. Each paper's main text and Technical Supplement is deposited separately; every quantitative claim traces to a named, executable check in the public theorem bank (over 3,800 bank-registered theorems, 48 quantitative predictions); and each result is carried at an explicit, graded level of confidence — from analytically forced to structurally grounded — with the measurements that would refute it named. Admissibility Physics is offered as a candidate, not a finished theory. If the program holds, the laws of physics could not have been otherwise: they are what a finite world permits. Website: admissibilityphysics.com. Engine and theorem bank: https://github.com/Ethan-Brooke/APF-Engine. Full series and latest deposits: Zenodo community admissibility_physics. The Engine — Admissibility Physics: An Executable Constraint Framework and Constants Map — DOI 10.5281/zenodo.18529115. Paper 0 — What Physics Permits: A Constraint-First Framework for Physics — DOI 10.5281/zenodo.18439523 Paper 1 — The Enforceability of Distinction — DOI 10.5281/zenodo.18439200 Paper 2 — Finite Admissibility and the Failure of Global Description — DOI 10.5281/zenodo.18439274 Paper 3 — Entropy, Time, and Accumulated Cost — DOI 10.5281/zenodo.18439363 Paper 4 — Admissibility Constraints and Structural Saturation — DOI 10.5281/zenodo.18439397 Paper 5 — Quantum Structure from Finite Enforceability — DOI 10.5281/zenodo.18439433 Paper 6 — Dynamics and Geometry as Optimal Admissible Reallocation — DOI 10.5281/zenodo.18439445 Paper 7 — A Minimal Quantum of Action from Finite Admissibility — DOI 10.5281/zenodo.18439513 Paper 8 — The Admissibility-Capacity Ledger — DOI 10.5281/zenodo.19721384 Paper 9 — The Geometric Substrate as Cost Structure of Comparison Continuations — DOI 10.5281/zenodo.20041675 Paper 10 — The Calculus of Finite Continuability — DOI 10.5281/zenodo.20041680 Paper 11 — Forced Universality from Capacity-Bounded Admissibility — DOI 10.5281/zenodo.20684198 Paper 12 — The Gauge Sector of Admissibility Physics — DOI 10.5281/zenodo.21212521 Paper 13 — The Minimal Admissibility Core — DOI 10.5281/zenodo.18361446 Paper 14 — The Quantum Story — DOI 10.5281/zenodo.21212188 Paper 16 — Markov Breakdown and the Hard Problems — DOI 10.5281/zenodo.20684207 Paper 18 — The Electroweak Sector as a Capacity Equilibrium — DOI 10.5281/zenodo.20684209 Paper 19 — Large-Angle CMB Suppression as a Finite-Continuability Constraint — DOI 10.5281/zenodo.21199218 Paper 20 — The Enforcement Crystal — DOI 10.5281/zenodo.18531732 Paper 23 — Magnetically Dark Winding-Class Quantum Processors — DOI 10.5281/zenodo.21199220 Paper 24 — The Recruitment-Radius Extension — Foundations — DOI 10.5281/zenodo.20684211 Paper 25 — The Recruitment-Radius Extension: Applications — DOI 10.5281/zenodo.21199222 Paper 28 — Absolute Mass Scales from Electroweak Capacity Saturation — DOI 10.5281/zenodo.20684215 Paper 29 — Plaquette Representation Dominance and Confinement — DOI 10.5281/zenodo.20684218 Paper 30 — A Tube Mechanism for the Lattice Mass Gap — DOI 10.5281/zenodo.20684220 Paper 31 — Osterwalder–Schrader Structure of Lattice Yang–Mills — DOI 10.5281/zenodo.20684222 Paper 32 — Quark Anchors as APF Trace Masses — DOI 10.5281/zenodo.21199226 Paper 33 — Trace-to-Scheme Export Architecture — DOI 10.5281/zenodo.20684224 Paper 35 — The Dark Sector as a Two-Role Capacity Decomposition — DOI 10.5281/zenodo.20684228 Paper 36 — The Missing Floor — DOI 10.5281/zenodo.21199228 Paper 37 — Collapse as Realignment — DOI 10.5281/zenodo.21199231 Paper 38 — Unification as Ledger — DOI 10.5281/zenodo.21199233 Paper 39 — Coherent Phase Regimes in the APF Interface Engine — DOI 10.5281/zenodo.21199235 Paper 40 — The Thermodynamics of Finite Distinction (Between Symmetry and the Void) — DOI 10.5281/zenodo.20684235 Paper 41 — The Horizon as a Continuation Ledger — DOI 10.5281/zenodo.20684241 Paper 42 — The Weak Mixing Angle Is Not Free — DOI 10.5281/zenodo.20684245 Paper 43 — The Neutrino Sector — DOI 10.5281/zenodo.21194191 Paper 44 — What a Finite Theory Owes the Continuum — DOI 10.5281/zenodo.21195874 Paper 45 — What the Vacuum Can Keep — DOI 10.5281/zenodo.21194195 Paper 46 — The Strong CP Angle Is Not Free — DOI 10.5281/zenodo.21194197 Paper 47 — The Confinement Antecedent Is Not Forced — DOI 10.5281/zenodo.21194199 Paper 48 — The Light-Bending Weight Is Not Free — DOI 10.5281/zenodo.21199627 Technical Supplements cross-link to their main paper via isSupplementTo and to the engine via isDocumentedBy. Concept DOIs above resolve to the latest version.
Modern quantum measurement theory relies on successful but ontologically incomplete instrumental formalisms, such as decoherence theory, Lindblad dynamics, POVMs, and consistent histories. While these frameworks describe the operational behavior of measurement, they lack a structural account of outcome uniqueness. This paper demonstrates that Boundary-Induced Collapse (BIC), derived from the Theory of Axiomatic Necessity (TNA), provides the foundational ontology from which these formalisms emerge as partial projections. Within this framework, collapse is redefined as a deterministic structural minimization governed by the realizability functional F(psi,B), where B represents the boundary operator encoding experimental and environmental constraints. We establish explicit mathematical correspondences showing that standard quantum formalisms are operational shadows of an underlying boundary-controlled necessity. Quantum randomness is thus characterized as an epistemic consequence of unresolved boundary degrees of freedom, rather than a fundamental stochasticity. Finally, we prove that boundary projections form a complete POVM resolution of identity, naturally recovering the Born rule through boundary ensemble averaging. Diagram https://drive.google.com/file/d/1TxZtBJpwCAzkOGBU3sEpLwhV7DoC3tFA/view?usp=drive_link Boundary engineering: https://zenodo.org/records/18290437 Short explanatory video summarizing the Boundary-Induced Collapse (BIC) framework and its ontological motivation https://vimeo.com/1157778709?share=copy&fl=sv&fe=ci This framework remains physically undecidable until subjected to boundary-engineered experimental collapse, presented in DOI https://zenodo.org/records/18295265 "Technical Note: Empirical Validation of the BIC-TNA Model"DOI https://zenodo.org/records/18306759 "Experimental Predictions of Boundary-Induced Collapse (BIC) in Quantum Devices" Reader’s Guide: Given the high density of the TNA formalization, readers primarily interested in how this framework resolves standard quantum paradoxes (Bell’s non-locality, unitarity, and the Born rule) may find it efficient to first consult the FAQ/Appendix E. This section addresses the most common interpretative frictions by deriving them as structural consequences of the boundary-induced model, providing a clearer context for the technical derivation in the main body. Dedication “To my grandfather, a casino manager, who taught me that roulette cylinders are changed every week.”
Papers I and II derived gravitational geometry and second-order dynamics from finite accessibility without invoking measurement, observation protocols, or collapse as primitive notions. This paper extends the operational program to the measurement sector, deriving the structure of record formation and probabilistic weights from the same finite accessibility and compositional constraints. Finite accessibility restricts admissible operations on a subsystem to a proper operator subalgebra. Because bounded certification excludes operators requiring nonlocal coordination or arbitrarily fine phase resolution, the accessible algebra is strictly smaller than the full operator algebra. When a system becomes correlated with orthogonal environment sectors, off-diagonal operators between those sectors fall outside the accessible algebra. The reduced state is therefore indistinguishable, under all admissible operations, from its diagonal ensemble. Definiteness emerges as an algebraic consequence of sector restriction, not as a collapse postulate. The weights of these sectors are fixed uniquely by compositional consistency. Phase invariance, multiplicativity under independent refinement, and stability under record coarse-graining constrain any admissible assignment of sector weights to satisfy a functional equation whose only continuous, non-contextual solution is quadratic in amplitude. The Born rule therefore arises as the unique invariant measure compatible with finite accessibility. Irreversibility follows from action scaling: reversal requires operators outside the admissible tensor algebra and incurs action cost proportional to the number of correlated subsystems. Since admissible operations are bounded by the action gap, macroscopic record reversal is excluded. Measurement introduces no new physical primitives beyond finite accessibility, locality, and compositional stability. Record formation, classical definiteness, and Born probabilities are structural consequences of algebraic restriction under finite accessibility. **This paper is part of the Finite Accessibility series, which reconstructs gravitational geometry, quantum dynamics, gauge structure, cosmological perturbation theory, and the dark sector from a single operational primitive: a finite certification ceiling ω* governing the maximum rate at which physical relations can be maintained across extended domains.** **Introductory papers** - Geometric Limits to Coherent Timekeeping in Extended Reference Frames — https://doi.org/10.5281/zenodo.18824556 - Accessibility Selection Law (ASL) — https://doi.org/10.5281/zenodo.18824649 - Phase Boundary Gravity — https://doi.org/10.5281/zenodo.18824707 **Pillars (numbered I–IV)** - Paper I: Deriving Gravitational Geometry and Schrödinger Dynamics from Finite Accessibility — https://doi.org/10.5281/zenodo.18601600 - Paper II: Deriving Inertia, Motion, and Wave Propagation from Finite Accessibility — https://doi.org/10.5281/zenodo.18625174 - Paper III: Accessible State Spaces, Record Stability, and the Emergence of Quantum Statistics — https://doi.org/10.5281/zenodo.18625192 - Paper IV: Frame Dissolution, the Certification Ceiling, and Observable Deformations — https://doi.org/10.5281/zenodo.18654458 **Extension papers** - Dark Matter from Finite Accessibility — https://doi.org/10.5281/zenodo.18654433 - Dark Energy from Finite Accessibility — https://doi.org/10.5281/zenodo.18654523 - No-Go Theorems and the Admissibility Corridor — https://doi.org/10.5281/zenodo.18654493 - Gauge Structure from Finite Accessibility — https://doi.org/10.5281/zenodo.18928152 - Perturbation Theory from Finite Accessibility — https://doi.org/10.5281/zenodo.18928213 **Experimental paper** - Experimental Probes of Finite Accessibility: GW Dispersion and Vacuum Path Independence — https://doi.org/10.5281/zenodo.18931126 **Keywords:** Born rule derivation, measurement problem, quantum statistics, finite accessibility, operator subalgebra, record formation, definiteness emergence, wave function collapse, compositional consistency, accessible state spaces, action gap, irreversibility, sector restriction, quantum foundations, algebraic quantum mechanics, decoherence
Quantum mechanics is traditionally interpreted as fundamentally indeterministic, elevating randomness to an ontological property of nature. This paper proposes a realist alternative within the Thermodynamic Narrative Ontology (TNA) framework, asserting that quantum randomness is not intrinsic but epistemic, emerging from incomplete access to the boundary conditions that govern structural projections. We reinterpret wavefunction collapse not as a stochastic event, but as a boundary-induced phase transition—a deterministic structural reconfiguration triggered by an abrupt shift in external constraints (B -> B'). By modeling measurement as an active redefinition of boundaries rather than passive observation, this framework accounts for non-local correlations and the statistical success of quantum formalism without invoking ontological chance. We argue that determinism resides in the boundary operators mediating the projection from the non-collapsed structural domain (aleph_1) into observable configurations (aleph_0). Consequently, quantum indeterminacy is reclassified as the "shadow" cast by unseen boundaries, reconciling the predictive power of quantum mechanics with a strictly realist and deterministic structural ontology. Boundary engineering: https://zenodo.org/records/18290437 Diagram https://drive.google.com/file/d/1TxZtBJpwCAzkOGBU3sEpLwhV7DoC3tFA/view?usp=drive_link Versioning Note New versions only add material to increase resolution.The conceptual object remains invariant.Version comparison for error detection is therefore meaningless. This short video is a conceptual overview of Boundary-Induced Collapse and its structural account of quantum measurement. https://vimeo.com/1157795828?share=copy&fl=sv&fe=ci To be continued... https://zenodo.org/records/18260026
Title: Meta-Tagging and Typing Physics: A Regime-Typed Closure Standard for Disambiguation (Normative) Description: This document is the normative spine of the TypedClosure bundle. It does not introduce a new physical theory. It freezes a minimal, attackable standard for discussing physics without regime drift — a discipline for forcing explicit separation between what is recorded, what is inferred to connect records, and what is interpreted as meaning. The core problem it addresses is that modern physics routinely mixes, in the same sentence, three distinct kinds of statement: committed records (what was measured), inferred structure connecting records (what is assumed to fill the gaps), and interpretive meaning (what it signifies). Without explicit regime typing, an inference quietly becomes treated as a recorded fact, or a local closure regime is assumed universal. The standard makes this mixing a hard failure condition rather than an ambiguity to be argued about. Two regimes are declared as primitives. Q (quantum-like / pre-record) is the regime of admissible relational reconfiguration without required sequential record — it provides configuration space, compatibility structure, and no intrinsic sequencing requirement. NQ (non-quantum / committed record) is the regime of committed, serialised, ordered records. NQv1 denotes the particular closure regime in which we as record-bearing systems operate, including spacetime notions, physical constants, and measurement practices, without assuming these are universal. The single loop skeleton unifies the entire stack: NQ → (lift/read) → Q → (admissible reconfigure) → Q → (close/commit) → NQ, repeated. Every record-to-record transition is factored through a Q bridge; the Q-internal degrees of freedom are then projected out to yield an effective NQ→NQ transition kernel. The notation (NQ Q NQ / Q)_loop is given a precise typed meaning: "/" is not division but projection/marginalization over Q-internal structure. This loop provides the common implementation skeleton for the solver (forward run plus backward audit), makes quantum-versus-non-quantum a typing difference rather than a new ontology, and makes falsification mechanical: a claimed NQ→NQ transition that cannot be factored through any declared Q admissibility path and closure rule fails Axiom 4. Eight axioms form the frozen spine. Axiom 0 asserts only that distinguishability exists. Axioms 1 and 2 declare Q and NQ. Axiom 3 (no realized state lasts) excludes absolute permanence under all admissible perturbations. Axiom 4 (no miracle jumps) requires an admissible relational path between any two ordered records. Axiom 5 (bookkeeping invariant) requires at least one ledger functional preserved across admissible transitions. Axiom 6 (bias is accumulated persistence) defines learning as what persists updating bias, with no teleology assumed. Axiom 7 (degrees of freedom shape admissibility) acknowledges that many axiom sets are possible and only some instantiate as NQv1. Axiom 8 (regime typing is mandatory) makes every untyped claim invalid within the standard. Tags and globs implement the disambiguation discipline. A tag is a binary Y/N gate enforcing distinction at closure. A glob is a declared tolerance band permitting overlap near boundaries, with a mandatory collapse trigger: when the trigger fires, the glob must resolve to a tag. Globs may not be widened post hoc without re-declaring constraints and re-running audits. The toy example (a threshold detector near its decision boundary) demonstrates that a single physical situation supports two distinct legitimate statements — an uncommitted Q read and a committed NQ record — and that without regime typing these collapse into one ambiguous "fact." The audit protocol treats verification as convergent cross-checking across five independent channels: linguistic algebra (meta-tags and typed headers), mathematics (symbolic operators on declared spaces), geometric algebra (closure geometry and curvature-style reasoning), URM/DSL (machine-facing normalisation under solver specs), and CGI geometry (simulation witness when available). A forward run executes implied operators and checks ledger invariants. A backward audit reverses the chain and identifies any untagged primitives; an untagged primitive appearing in the backward audit is a hard failure. Minimal pseudo-code for the solver loop is provided. Derived terms — decoherence, entropy, causality, budget/inertia/spend — are permitted only as typed descriptors under declared regimes, not as untyped ontological claims. Each is given its precise regime typing. Budget, inertia, spend, and spend-rate are explicitly flagged as NQv1-interpretive descriptors that must reduce to standard quantities under unit choice and representation. Four explicit failure modes are declared: ledger failure (invariant violates declared tolerance — hard fail), regime drift (NQ terms used under Q tag or vice versa — hard fail), glob abuse (tolerance widened post hoc without re-declaration — hard fail), and empirical mismatch (Work[Q] holds but Work[NQv1] fails — soft fail, indicating either a different closure regime or an incomplete representation map). This document is the entry point for the entire TypedClosure stack. Application papers (black holes, Navier–Stokes, Lorentz regime, double-slit) demonstrate the discipline on real targets. Bridge papers make cross-regime degrees of freedom explicit. The Equation Library maps common physical equations into Info/Change/Gate/Ledger roles. This normative standard is what all of them are governed by. Bundle DOI: 10.5281/zenodo.18777607 Keywords: typed closure, regime typing, meta-tagging, normative standard, Q regime, NQ regime, NQv1, tags, globs, collapse trigger, bookkeeping invariant, audit protocol, solver loop, forward run, backward audit, falsification, regime drift, decoherence, entropy, causality, disambiguation, admissibility, distinguishability, axioms, single loop skeleton, measurement, record, pre-record, non-quantum, quantum-like, closure standard, physics foundations