Research Abstracts — Preview

Paper 00 — Overview of the NEMS Framework

The suite overview: structure, dependency map, reader paths for all audiences.

Zenodo (PDF + DOI)

Paper 01 — The NEMS Framework: No External Model Selection as a Principle of Foundational Self-Containment

Introduces NEMS as a foundational self-containment principle and derives its first consequences.

This paper introduces the No External Model Selection (NEMS) framework to a physics audience, explaining in physical rather than model-theoretic language what NEMS requires, why it matters, and what it implies for programs that rely on external choosers (measures, vacuum selectors, observer maps) to extract determinate predictions. The central result is a trichotomy: any candidate fundamental theory is either record-level categorical, internally selecting, or not fundamental in the NEMS sense. The paper summarizes the Externality Reduction bridge (every "outside dependency" is selection in disguise), the semantic visibility closure (the semantics cannot hide outside the records), and the results of three illustrative audits applied to multiverse cosmology, the string landscape, and computational-universe programs. The core theorem spine is machine-checked in Lean 4 (v2.0.0, 8051 jobs, zero sorry, zero custom axioms). The framework does not adjudicate which theory is correct; it provides a precise, auditable criterion for when a theory qualifies as a complete foundational explanation.

Zenodo (PDF + DOI)

Paper 02 — The No External Model Selection Theorem: Semantic Closure, Categoricity, and Diagonalization Constraints

Proves the core NEMS theorem: semantic closure, categoricity, and diagonal barriers.

This paper studies the structural consequences of "no external model selection": the requirement that a realized world is not chosen by ontologically external information among observationally inequivalent realizations of a finite law-description. A minimal axiom package is formalized — single actuality for observational records, no external selection among observationally inequivalent models, a finite syntactic description, exclusion of unconstrained completion data ("free bits"), and sufficient expressiveness for self-reference — and from these assumptions a model-theoretic dichotomy is derived: either the law-description is categorical up to observables or the realized system contains an internal selection functional. Under explicit self-reference hypotheses (the arithmetic self-reference package ASR), any such selection mechanism cannot be a total effective functional on the diagonal fragment, yielding a sharp refinement into restricted/stratified (Class IIa) versus non-effective (Class IIb) internal selection. The resulting classification theorem partitions all candidate universes and autonomous self-modeling systems satisfying the axioms into four universality classes (I, IIa, IIb, III), with applications and domain-specific consequences treated as corollaries under additional premises.

Zenodo (PDF + DOI)

Paper 03 — Structural Stability as a Necessity Principle in Self-Contained Gauge Theories

Derives structural stability (NM*) as a theorem from PSC, excluding GUT groups and CP-conserving theories.

This paper derives the NM condition (Structural Stability) as a necessary consequence of Perfect Self-Containment (PSC) for physical theories, establishing a derivation chain: PSC ⇒ Reflexive Closure (RC) ⇒ NM. Reflexive Closure — the requirement that a theory compute its own S-matrix — is proven to follow from the minimal definition of self-containment, and NM — constancy of qualitative type on an open dense subset of parameter space — is proven to follow from RC, establishing NM not as an axiom but as a theorem. Four consequences are derived: GUT groups are excluded via vacuum topology bifurcations; vector-like fermion theories are excluded; theories without massless particles are excluded; and CP-conserving theories are excluded. These constraints, previously treated as separate physical arguments, are unified under a single derivation chain resting on one philosophical commitment: fundamental theories must be self-contained. The analysis is restricted to 4D renormalizable gauge QFTs without gravity.

Zenodo (PDF + DOI)

Paper 04 — Instantiating No External Model Selection in Physics

Applies NEMS to macroscopic physical records and establishes the Class IIb criterion.

This paper instantiates the No External Model Selection Theorem in a physics-grounded setting by fixing an observational fragment based on stable macroscopic records. Building on the universality-class classification of realized systems under single actuality, no external model selection, and no free completion bits, it provides explicit sufficient conditions under which a realized universe must lie in Class IIb relative to the record language: observational multiplicity forces internal selection, and diagonal-capable self-reference on the same record fragment forbids total effective selection. The paper contributes (i) a minimal, operational definition of a record language L_rec and its record-truth semantics; (ii) a minimality theorem showing that L_rec captures the weakest standard observational commitments needed for empirical science; (iii) two complementary routes to establishing record-level non-categoricity in physically universal systems (Route A via universality/undecided record propositions; Route B via the no-free-bits exclusion of trivial categoricity); and (iv) a theorem package separating a core Class IIb criterion from domain-specific premises that imply its hypotheses. An appendix provides a fully explicit Route A construction with a universality dichotomy lemma, and a second appendix gives mainstream physical support for the universality premise (P4) via cellular automata, reversible computation, and quantum simulation.

Zenodo (PDF + DOI)

Paper 05 — PSC-Optimality of the Standard Model in 4D Gauge Theory Space

Proves the Two-Layer PSC Theorem: hard constraints force SU(3)×SU(2)×U(1); PI selects 3 generations.

This paper analyzes the space of 4D renormalizable gauge quantum field theories under five axioms of Perfect Self-Containment (PSC): Reflexive Closure (RC), Structural Stability (NM*), Thermodynamic Viability (TV), Semantic Admissibility (SA), and Presentation Invariance (PI). A Two-Layer PSC Theorem is proven: Layer I (Consistency) shows that the hard PSC axioms narrow admissible gauge topologies to SU(3)×SU(2)×U(1) with anomaly-minimal chiral matter and N_gen ≥ 3; Layer II (Optimality) shows that Presentation Invariance selects N_gen = 3 as the unique minimal solution. The result precisely distinguishes what is forced by self-consistency from what is selected by minimality, providing a rigorous derivation of the Standard Model gauge structure and three-generation structure from first principles without invoking empirical input.

Zenodo (PDF + DOI)

Paper 06 — No External Model Selection in Quantum Gravity

Extends NEMS to quantum gravity via records, diffeomorphism redundancy, and non-effective internal selection.

This paper applies the No External Model Selection (NEMS) classification framework to quantum-gravity completions by fixing a minimal gravitational record language and isolating quantum-gravity structure that forces record-level non-categoricity absent internal selection. The main result is a theorem package: (i) a minimality lemma for the gravitational record fragment L_rec^grav, showing that any observational language adequate for empirical quantum gravity interprets it up to definitional extension; (ii) a quantum-gravity non-categoricity theorem establishing |WTypes(T_σ; L_rec^grav)| > 1 under explicit, framework-neutral gravitational premises unless internal selection is already present; and (iii) a Class IIb consequence under the NEMS closure bundle. Two complementary mechanisms for non-categoricity are provided: Route A (relational/gauge anchoring multiplicity — diffeomorphism redundancy forces relational anchoring of records, and multiple compatible but distinguishable anchoring schemes yield observational multiplicity) and Route B (horizon/complementarity reconciliation multiplicity — horizon-class phenomena produce context-dependent record descriptions whose reconciliation is underdetermined by the base theory). A definability bridge theorem shows that any anchoring or reconciliation mechanism that is not observationally definable from the remaining primitives constitutes free completion data, contradicting the no-free-bits premise. The paper also provides a holography/complementarity taxonomy organizing bulk–boundary encoding proposals into the NEMS universality classes, and an appendix gives a fully formal Route B construction via cross-context linkage sentences.

Zenodo (PDF + DOI)

Paper 07 — The NEMS Framework for Physicists

Self-contained introduction to NEMS for physics audiences; covers gauge structure and quantum gravity angle.

This paper introduces the No External Model Selection (NEMS) framework to a physics audience, explaining in physical rather than model-theoretic language what NEMS requires, why it matters, and what it implies for programs that rely on external choosers (measures, vacuum selectors, observer maps) to extract determinate predictions. The central result is a trichotomy: any candidate fundamental theory is either record-level categorical, internally selecting, or not fundamental in the NEMS sense. The paper summarizes the Externality Reduction bridge (every "outside dependency" is selection in disguise), the semantic visibility closure (the semantics cannot hide outside the records), and the results of three illustrative audits applied to multiverse cosmology, the string landscape, and computational-universe programs. The core theorem spine is machine-checked in Lean 4 (v2.0.0, 8051 jobs, zero sorry, zero custom axioms). The framework does not adjudicate which theory is correct; it provides a precise, auditable criterion for when a theory qualifies as a complete foundational explanation.

Zenodo (PDF + DOI)

Paper 08 — From NEMS to MFRR: A Machine-Checked Bridge Between Semantic Closure and Reflexive Reality

Machine-checked bridge connecting the NEMS closure theorems to the broader Reflexive Reality framework.

This paper constructs a formal, machine-checked bridge between the NEMS (No External Model Selection) classification framework and the MFRR (Mathematical Foundations of Reflexive Reality) program. It shows that MFRR's Perfect Self-Containment (PSC) condition, combined with record-divergent choice points, forces the existence of an internal adjudication principle (Transputation / PT) as a theorem of the NEMS classification spine. Under diagonal capability — formalized via an Arithmetic Self-Reference (ASR) structure that bridges record-truth to the halting problem — record-truth is provably not computably decidable, constraining any selector to be non-total-effective. The diagonal barrier is proved via reduction to Mathlib's machine-checked halting undecidability theorem, yielding a library with zero custom axioms. All results compile in Lean 4 (v4.28.0, Mathlib 4.28.0, 8051 jobs, zero sorry). This bridge upgrades MFRR's central claim — that a closed universe must contain a lawful, non-algorithmic internal adjudicator — from a physical argument to a fully machine-checked theorem with no escape hatches, making every assumption explicit and auditable.

Zenodo (PDF + DOI)

Paper 09 — Physical Records Imply Non-Effective Internal Adjudication

Proves that diagonal-capable physical records force non-effective internal adjudication in PSC universes.

This paper establishes a universality-level consequence of Perfect Self-Containment (PSC) for any candidate closed theory of the physical universe. Using the machine-checked NEMS classification spine and a machine-checked bridge to the MFRR adjudication principle (Transputation / PT), it proves two results: (i) internal adjudication is forced — if macroscopic records do not uniquely determine a realization and the theory is PSC at the NEMS interface level, then an internal selector/adjudicator exists as a theorem; and (ii) total effective adjudication is forbidden on diagonal-capable record fragments — if the record fragment is diagonal-capable in the ASR sense, then record-truth is not computably decidable, and therefore no internal adjudicator can be total-effective on that fragment. The formal core is kernel-verified in Lean 4 with zero custom axioms, reducing the diagonal constraint to Mathlib's machine-checked halting undecidability theorem. The paper supplies the remaining physical component: a conservative argument that our universe satisfies the required premises in any realistic macroscopic-record description, because physical systems implement universal computation (yielding diagonal capability at the record level) and physically admissible dynamics generically exhibit record-level underdetermination in any account that permits stable macroscopic records. This constitutes a Gödel/Turing-class constraint on the form of closed physical theories.

Zenodo (PDF + DOI)

Paper 10 — Transputation Versus Computation

Distinguishes Transputation (non-algorithmic internal adjudication) from computation and proves its necessity.

This paper distinguishes computation — effective rule application reducible to Turing computation — from transputation — a law-governed internal adjudication required in perfectly self-contained (PSC) theories when observational records do not uniquely determine realizations. The distinction is formalized using the NEMS framework: in record-non-categorical settings, PSC forces an internal selector (adjudicator) selecting canonical representatives of observational world-types. Under diagonal capability, formalized by an Arithmetic Self-Reference (ASR) structure, record-truth on the ASR fragment is not computably decidable, and therefore no internal adjudicator can be total-effective on that fragment. These forcing and diagonal results are kernel-verified in Lean 4 with zero custom axioms, reducing the diagonal barrier to Mathlib's halting undecidability theorem. The paper then presents MFRR's mechanistic proposal for transputation — coherence-driven minimization of a dissonance functional (DSAC/PR-0 style dynamics) — which implements internal adjudication as a physical relaxation process rather than a total algorithmic decider. The paper concludes with a taxonomy of where computation suffices, where transputation is forced, and how transputation may be instantiated in realistic physical systems with stable macroscopic records and universal computation.

Zenodo (PDF + DOI)

Paper 11 — Physical Incompleteness from Universal Computation

Machine-checked diagonal barrier: closed physical theories with universal computation are physically incomplete.

Release role: first-entry theorem surface for the broader diagonal/closure program (stated in-paper).

Zenodo (PDF + DOI)

Paper 12 — Determinism No-Go Under Perfect Self-Containment

Diagonal-capable records forbid total-effective record determinism in theories with genuine record-divergent choice.

This paper proves a determinism no-go theorem for closed physical theories with macroscopic records. Using the machine-checked NEMS classification spine and the machine-checked diagonal barrier, it shows that in any perfectly self-contained (PSC) framework that is both (i) diagonal-capable at the record level (i.e., it can encode universal computation and halting as record-truth) and (ii) admits genuine record-divergent choice (multiple admissible continuations disagreeing on records), there is no total effective deterministic law that maps past records to unique future records on the diagonal-capable fragment. Formally, any purported total computable "record determinism" function would induce a total computable decider for diagonal-capable record-truth, contradicting the diagonal barrier proved via reduction to Mathlib's halting undecidability theorem. The proof is kernel-verified in Lean 4 with zero custom axioms. This establishes a Gödel/Turing-class limitation on deterministic closure: if a theory is PSC and admits record-divergent choice, then any determinism compatible with diagonal-capable records must be non-total-effective (or must retreat to record-categoricity / triviality).

Zenodo (PDF + DOI)

Paper 13 — Born Rule as a Closure Fixed Point

Proves the Born rule is the unique quantum probability assignment in perfectly self-contained theories.

This paper proves that the Born rule is the unique consistent probability assignment for any perfectly self-contained (PSC) theory whose records carry quantum effect structure. The argument has two interlocking stages. In the formal stage, it is machine-checked in Lean 4 that any normalized, POVM-additive probability assignment μ on n-dimensional quantum effects has at most one density operator ρ representing it: μ(E) = Re(Tr(ρE)) for all effects E. The uniqueness theorem is fully proved with zero sorrys, using three families of test effects that together span the space of Hermitian matrices and extract every matrix entry of ρ. In the physical stage, PSC forces any record-level probability assignment to be noncontextual and POVM-additive, because probabilities that depend on external measurement context introduce semantic externality that PSC excludes. Therefore, if a Born-rule density operator exists (Busch/Gleason existence, a known result), it is provably unique by the machine-checked argument. The Born rule is thus not a postulate but the only fixed point of closure. The approach generalizes standard Gleason-type derivations: it applies to POVMs (not only projectors), requires no dimension lower bound, and is interlocked with the NEMS/MFRR record-closure framework.

Zenodo (PDF + DOI)

Paper 14 — Born Internal & Complete Semantics Implies Perfect Self-Containment

The reverse direction: from quantum probability (Born rule) back to closure.

This paper proves the reverse direction of the PSC–Born fixed-point architecture: if quantum probability (Born rule) provides the internal, complete semantics for macroscopic records, then external model selection is impossible and the theory must satisfy Perfect Self-Containment (PSC). Born Internal & Complete Semantics (BICS) is defined as a semantic-architecture condition stating that record probabilities are given by the Born rule via an internal quantum state, are context-independent (noncontextual), and are semantically complete (no external completion bits). The paper proves: BICS ⇒ NEMS (No External Model Selection), and under existing closure reductions (Externality Reduction + semantic visibility), BICS ⇒ PSC bundle / Full PSC. Combined with the forward direction (Papers 08 and 13: PSC ⇒ Born semantics), this establishes a fixed-point equivalence: within an explicitly defined universe class, PSC and Born-as-internal-complete-record-semantics are architecturally equivalent. The core theorem (BICS ⇒ NEMS) is fully machine-checked in Lean 4 with zero custom axioms and zero sorry. This completes the NEMS suite by closing the loop between semantic closure, quantum probability, and perfect self-containment.

Zenodo (PDF + DOI)

Paper 15 — No-Emulation and Self-Necessitating Adjudication (C1)

Proves no-emulation as a constraint and that self-necessitating adjudication follows from closure.

This paper proves that in any diagonal-capable physical framework — one expressive enough to host the halting problem in its record fragment — no total computable function can emulate the internal adjudication operator (Transputation, PT) on all inputs. A choice-point interface is defined, identifying states where PT must actively select among multiple valid continuations, and an adjudication function is defined specifying the valid-selection contract. The No-Emulation Theorem is then proved: any claimed computable emulator for PT would yield a total computable decider for record-truth RT on the diagonal fragment, contradicting the diagonal barrier established in Papers 11–12. The proof is a one-step reduction to the existing machine-checked diagonal_barrier_rt theorem. As a corollary, active internal selection (Transputation) is self-necessitating: it cannot be replaced by any static algorithm. This is the first theorem of Phase 2 of the NEMS program, bridging the diagonal barrier to the necessity of observer-like adjudication infrastructure (Papers 16–17). All results are machine-checked in Lean 4 with zero custom axioms and zero new sorrys (8069 jobs, build clean).

Zenodo (PDF + DOI)

Paper 16 — Relative PSC and Recursive NEMS (Fractal Closure) (C2)

Fractal closure: relative PSC and recursive application of NEMS constraints.

This paper introduces the concept of relative closure for subsystems within the No External Model Selection (NEMS) framework. By defining a subsystem as an autonomous framework with its own internal model, records, and truth relations, we prove a powerful recursion principle (Recursive NEMS): if a subsystem implements complete internal semantics (BICS) for its own records, it necessarily satisfies NEMS relative to its environment. Furthermore, we prove the heredity of the diagonal barrier: if a subsystem is rich enough to host Arithmetic Self-Reference (ASR), the undecidability of its internal record-truth applies directly to it, rendering its internal adjudication non-emulable by any total-effective algorithm. This establishes the "fractal" nature of semantic closure in NEMS. We also present a strengthened version of the No-Emulation theorem (deferred from Paper 15), explicitly formalizing the instance-level encoding that bridges physical emulation and computational decidability. All definitions and theorems are fully machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 17 — Necessary Adjudicators and Reflexive Self-Model Closure (RSMC) (C3)

Proves necessary adjudicators and the reflexive self-model closure requirement.

This paper establishes that observer-like subsystems are not accidental flukes of biology, but necessary infrastructural components of any physical universe that maintains global record stability and nonlocal coherence while satisfying Perfect Self-Containment (PSC). Building on the No External Model Selection (NEMS) framework, we prove a weak necessity theorem: if a PSC universe contains persistent, re-readable records and must reconcile record-truth across distributed contexts, it must contain a network of internal subsystems (Adjudicator Nodes) that maintain records, adjudicate local choice points, and propagate sufficient information to support global coherence. Crucially, we show that if such a node is computationally rich enough to host Arithmetic Self-Reference (ASR) and robust enough to maintain its semantics under self-reference, it is forced to develop Reflexive Self-Model Closure (RSMC)—an operational, non-anthropic surrogate for self-awareness. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 18 — The Theorem of Semantic Terminality (T1)

Semantic terminality: the closure of semantic self-description under NEMS constraints.

This paper proves that the reductionist regress—the assumption of an endless hierarchy of deeper micro-theories—must terminate in any universe satisfying Perfect Self-Containment (PSC). We introduce the concept of a PSC-optimal theory, which minimizes descriptional complexity while fully capturing all macroscopic record facts. The Theorem of Semantic Terminality establishes that any "deeper" theory extending a PSC-optimal description either fails foundational status (by requiring new external selectors, thus violating PSC) or is physically redundant (adding unforced complexity without altering record-truth). This implies that a foundational theory achieving record-level closure, such as the Standard Model at its appropriate scale, is not merely an effective approximation but the logical limit of semantic closure. All definitions and theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 19 — The Non-Emulability of Execution — Agentic Necessity (T2)

Execution cannot be emulated from within; agentic necessity follows.

This paper formalizes the refutation of static models of reality, such as the "Block Universe" and the Simulation Hypothesis, by proving that the universe must be actively "run" from within. Building on the Diagonal Barrier (Papers 11-12), we introduce the premise of Record-Divergent Choice: the existence of internal adjudication events that strictly determine future macroscopic records. We prove the Theorem of Execution Necessity: no total-effective static algorithm can perfectly emulate the universe's internal adjudication. If such an emulation existed, it would induce a computable decider for record-truth, violating the diagonal barrier. Consequently, internal adjudicators (agents) are not biological accidents but the necessary execution engine of physical reality. All definitions and theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 20 — Rigidity of the Gauge Signature under PSC: A Sieve Theorem (T3)

Sieve theorem for theory spaces; residual classification program for gauge signatures.

This paper extends the logic of semantic closure to the gauge structure of the universe, challenging the string theory "landscape" paradigm. We propose that the Standard Model gauge signature is the unique mathematical fixed point for any stable, self-contained record-bearing system in 4D spacetime. We formalize a PSC Sieve on 4D gauge-theory space, consisting of self-containment constraints: structural stability (NM*), semantic admissibility (SA), thermodynamic viability (TV), and anomaly consistency. We prove that these constraints eliminate large classes of theories, leaving a highly constrained residual set. We state the Residual Classification Conjecture: within this residual set, only the SU(3) × SU(2) × U(1) signature with 3 generations survives. All definitions and conditional theorems are formalized in Lean 4, and the residual conjecture is supported by a reproducible computational classification pipeline.

Zenodo (PDF + DOI)

Paper 21 — The Theorem of Existential Rigidity: The Collapse of Contingency (T4)

Contingency collapses under PSC: existence is not contingent but necessary.

This paper formalizes the ultimate ontological conclusion of the NEMS framework: in a self-contained reality, mathematical possibility collapses into a single, singular solution. We define a theory as ontologically legal if it is foundational (does not require external selectors or free bits) and is not physically redundant relative to a PSC-optimal terminal theory. Building upon the Sieve Theorem (Paper 20) and the Semantic Terminality theorem (Paper 18), we prove the Theorem of Existential Rigidity: if the Residual Classification Conjecture holds, the Standard Model signature is not merely an optimal effective theory, but the only ontologically legal foundation for a universe. Any other mathematically possible gauge group violates the closure axioms, making it an incomplete foundation. Under these premises, contingency collapses. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 22 — Irreducible Agency: Non-Algorithmic Adjudication as a Physical Requirement (T5)

Agency is irreducible: non-algorithmic adjudication is a structural physical requirement.

This paper formalizes the theorem that in a Perfectly Self-Contained (PSC) universe with computers, the internal adjudicator network cannot operate via a total computable function. By merging the Diagonal Barrier (Papers 11–16) with Adjudicator Necessity (Paper 17) and Execution Necessity (Paper 19), we prove that a "dead" algorithmic law cannot reach a determinate state. The "law of physics" at the choice-resolution layer is strictly non-algorithmic. This establishes irreducible adjudication at the choice-resolution layer: internal record determinacy in a diagonal-capable PSC universe requires a non-total-effective adjudication mechanism. Observer-like subsystems are interpreted as the physical implementation of this mechanism within a record-stabilizing network. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 23 — Foundational Finality: The Master Loop and the End of Reductionism (T6)

The master loop theorem; reductionism ends at the reflexive fixed point.

This paper formalizes the theorem that physics terminates at the Reflexive Fixed Point. We define a "Master Loop" as a physical framework where the law-description, record semantics, and execution mechanism are internally co-realized without external separation. We prove the Theorem of Foundational Finality: any attempt to explain a Perfectly Self-Contained (PSC) universe from the "outside" (e.g., via a simulator, a multiverse measure, or an external runner) must either violate self-containment, be physically redundant, or be isomorphic to the original universe. We further demonstrate that the universe is a literal fixed point of the map from ontology to semantics and back to optimal ontology. This establishes that no foundational explanation can rely on external model selection without ceasing to be foundational. All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 24 — The Theorem of the Semantic Floor: The Minimal Reflexive Seed (T7)

Minimal reflexive seed theorem: the semantic floor forced by PSC.

This paper formalizes an information-theoretic constraint on the initial conditions of a Perfectly Self-Contained (PSC) universe. We prove the Theorem of the Semantic Floor: a PSC universe cannot originate from an underspecified initial boundary that requires external completion data to determine record-truth. Instead, any admissible initial state must possess a "Semantic Floor"---a structural capacity to host or internally generate Diagonal Capability (Arithmetic Self-Reference) and Internal Adjudication ($\PT$) without relying on an external model selector. We show that classical singularities, which represent states of infinite underdetermination requiring external initial conditions, are non-foundational under PSC. The universe must begin as a discrete, self-interpreting "Reflexive Seed." All definitions and conditional theorems are formalized and machine-checked in Lean 4.

Zenodo (PDF + DOI)

Paper 25 — The Unified Rigidity Theorem: The Lepton Seed (T8)

Unifies the rigidity results; the lepton seed is the unique PSC-minimal survivor.

This paper formalizes the final capstone theorem of the NEMS/MFRR suite: the Unified Rigidity Theorem. We prove that the intersection of Gauge Rigidity (the PSC Sieve) and Gravitational Anchoring (Relationalism) isolates a singular, necessary Reflexive Seed for reality. By bridging the abstract NEMS closure constraints with the specific Generative Triple Evolution (GTE) mechanics, we identify the Lepton Seed Triple (1, 73, 823) as the unique instantiation of the Semantic Floor. We define Unified Admissibility as the conjunction of the Semantic Floor, Quarter-Lock Rigidity, and Relational Anchoring. The Residual Seed Uniqueness Theorem (RSUC) — proved in the ugp-lean artifact — states that the residual set collapses to the Lepton Seed up to mirror equivalence and Presentation Invariance. Under RSUC and the premise bundle (P25.1)–(P25.4), any admissible foundational seed has the Lepton Seed as its canonical (MDL-minimal) representative. This concludes the suite by demonstrating that our specific laws of physics are not a contingent fit to empirical data, but the unique semantic solution for a self-contained reality. All definitions and theorems are formalized and machine-checked in ugp-lean.

Zenodo (PDF + DOI)

Paper 26 — A General Self-Reference Calculus

One fixed-point theorem and one diagonal barrier behind Gödel, Kleene, Löb, and NEMS.

Release role: exposes the reusable self-reference engine underlying multiple diagonal phenomena (stated in-paper).

Zenodo (PDF + DOI)

Paper 27 — A No-Free-Bits Calculus for Determinacy and Outsourcing

Closure audits for theories: a no-free-bits calculus measuring internal determinacy and outsourcing.

Theory-closure and audit toolkit for “no free bits”: observational semantics, world-types, selectors, parameterized internality, and audit soundness (decidable-on-world-type ⇒ invariant; contrapositive: non-invariant ⇒ not decidable on world-types). The paper distinguishes two equivalent selector presentations: quotient selectors (sections q : WType → World of the quotient map) and world-selectors (endomaps sel : World → World satisfying invariance, idempotence, class-canonicality). New (§4.3): Selector–Quotient Splitting Equivalence — proves these two notions are in canonical bijection (selectorSectionEquiv): every world-selector factors through a unique quotient selector (selector_quotient_splitting, selector_equiv_section), and every quotient selector induces a world-selector (quotientSectionToSelector, section_defines_selector_general). This identifies the exact mathematical content of the selector abstraction: a world-selector is precisely a right inverse of the world-type quotient projection. The substantive closure question is therefore not whether selectors classify world-types (they do) but whether the corresponding quotient section is internally realizable. Negative instance: The halting-framework bridge proves no computable quotient section exists under ASR and unbounded world-types (QuotientSectionBridge, halting_framework_no_computable_section). Full barrier: QuotientSectionStrength proves no computable decider exists for any nontrivial extensional predicate on the halting framework (halting_framework_no_decider_at_computable). Canonicalization, EffectiveSemantics, and BoundedCover lead to a nailed instance: under bounded cover and canonicalization, a selector exists; with DecidableEq WorldType, a total bounded-search selector is built without Choice. FintypeWorld shows finite worlds + decidable observational equivalence ⇒ selector. The A0 bridge (internal representability ⇒ SRI′) connects Closure to SelfReference so MFP-1 and the diagonal barrier apply. Zero sorrys, zero custom axioms.

Zenodo (PDF + DOI)

Paper 28 — Reflection as a Resource

Stratified representability, fixed points under restricted internalization, and a selector-strength hierarchy.

Fills the graded middle ground between Paper 26 (full repr ⇒ MFP-1) and Paper 27 (closure audits): how much internalization is enough for which fixed points. Parameterizes representability by a class R ⊆ (Code→Obj). Diagonal Closure Theorem: if R is closed under the diagonalization template, then every F∈R has a mixed fixed point p ≃ F(quote p). When R is not diagonally closed, method-level separation: e.g. R = {id} on ℕ is not diagonally closed; the diagonal construction cannot generate a fixed point via repr(G_F) because G_F ∉ R. Bridge to Closure and SelfReference. Sets up Papers 29 and 30. Lean: SRI_R, DiagClosed, restricted_master_fixed_point, not_diagClosed_identity_only, method_level_separation; zero sorrys, zero custom axioms.

Zenodo (PDF + DOI)

Paper 29 — Selector Strength and Completion Hierarchies

A poset of internal determinacy, barriers, and escape costs.

Formalizes selector strength as a preorder (selector-strength lattice) of realizability classes and proves the barrier theorem family: under anti-decider closure and a fixed-point premise (hFP) at a strength level, no total decider exists at that strength for any nontrivial extensional predicate. Reflection supplies hFP when the representability class R is diagonally closed; Closure supplies the selector-at-strength vocabulary. Monotonicity; instances: trivial “all functions” (S_all) and a template for computable-on-ℕ (parametric hFP). Maps the hierarchy to NEMS IIa/IIb. A concrete quotient-section barrier is mechanized in QuotientSectionBridge: under ASR and unbounded world-types, no computably realizable quotient section exists; the halting-framework bridge uses Mathlib's Nat.Partrec.Code with no custom axioms. Fully instantiated computable barrier (QuotientSectionStrength): on the halting framework, no computable δ decides any nontrivial extensional predicate (e.g. halts on 0); composes nems_rt_no_computable_bool_decider with Nat.Partrec.Code.fixed_point. Lean: no_total_decider_at_strength, reflection_supplies_hFP, decidableAt_mono, S_all, no_total_decider_nat, halting_framework_no_decider_at_computable; zero sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 30 — Second Incompleteness for Self-Certifying Learners

No total internal certifier exists under diagonal capability — a learning-theoretic incompleteness.

Applies the Paper 29 barrier to self-trust in learning systems: certificates, claims (guarantee predicates), and internal verifiers. Proves no total internal self-certifier exists for any nontrivial extensional claim when the strength is anti-decider closed and has the fixed-point premise (hFP); Reflection supplies hFP when R is diagonally closed (“diagonal capability”). Defines diagonal capability precisely; states the result as a “second incompleteness for self-certifying learners.” Positive result: when hFP is not supplied (Stratum 1), total internal verifiers can exist—stratified self-certification; toy claim (n=0) at S_all with explicit no-contradiction note. Minimal toy and learning-flavored sketch (hypothesis fits finite dataset). Companion note: “Why Perfect Self-Certification Is Impossible in Self-Referential Systems.” Lean: no_total_self_certifier, reflection_supplies_hFP_for_learning, ToyClaim, stratified_self_certification_toy; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 31 — Epistemic Agency Under Diagonal Constraints

Society as a verification protocol; strict separations and the necessity of role diversity.

Turns the Papers 26–30 spine into a theorem-grade theory of epistemic agency and social verification. Restates as an agency theorem: no diagonal-capable agent admits a universal total internal self-certifier for any nontrivial extensional claim (imported from Paper 30). Formalizes society as a verification protocol: a finite family of verifiers with soundness-on-coverage, aggregated by an admissible protocol that does not hallucinate where all inputs abstain. Proves strict separation: there exist societies and protocols whose certified coverage is strictly larger than that of any individual verifier. Proves necessity: homogeneous societies cannot strictly improve under admissible protocols, and role diversity (non-identical coverage sets) is necessary for strict improvement. Adds corollaries for control verification (safety, stability, bounded loss) and for stratified self-awareness and the necessity of social mirrors. Shows that if society-plus-protocol is treated as a single diagonal-capable system attempting universal total self-certification, the Paper 30 barrier reappears at the societal level (meta-barrier). Lean: EpistemicAgency library; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 32 — Self-Improvement Under Diagonal Constraints

No universal self-upgrade certifier; stratified improvement and evolution as an attractor architecture.

Formalizes self-improvement as upgrade certificates and good-predicates over agents. Proves a barrier theorem: no total internal self-upgrade certifier exists under diagonal capability (Paper 30 applied to upgrades). Proves stratified improvement (positive result when hFP is not assumed), protocol strict improvement (societies plus admissible protocols can strictly improve certified coverage), and diversity necessity (homogeneous societies cannot strictly improve). A meta-barrier shows that society-plus-protocol as a single diagonal-capable system cannot totally self-certify upgrades. Lean: no_total_upgrade_certifier, stratified_improvement_schema, protocol_strict_improvement_upgrades, diversity_necessary_upgrades, meta_barrier_self_improvement; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 33 — Self-Awareness as a Resource

Hierarchies of internal self-knowledge, selector necessity, and limits of introspective optimality.

Formalizes self-awareness as internal certification capacity over classes of self-claims. Proves three theorem families: (i) self-awareness hierarchy — strict separations (e.g. C₀ admits total certifier; C₂ does not under diagonal capability); (ii) selector necessity — when multiple observationally indistinguishable self-model fixed points exist, identifying “the actual self” requires symmetry-breaking selection, non-total-effective in diagonal-capable regimes; (iii) introspective optimality barrier — no diagonal-capable agent can totally certify nontrivial extensional “rightness of decision” in full generality; stratified positive results on restricted fragments. Lean: ClaimFamilies, SelfModel (Fix, MultipleFixedPoints), no_total_certifier_C2, selection_not_total_effective, selector_necessary_from_multiplicity, no_total_rightness_certifier, ToyHierarchy, ToyRightness; 0 sorry, zero custom axioms.

Zenodo (PDF + DOI)

Paper 34 — A Sieve Engine for Theory Spaces

Proof-carrying classification and residual certification for theory spaces.

Adds a meta-methodology kernel for theory spaces: a type of candidates with optional equivalence and canonicalization, constraints as a list of predicates, a sieve as the conjunction of constraints, and a residual as the subtype of candidates satisfying the sieve. Proves monotonicity (adding constraints shrinks the residual) and residual functoriality (pullback of constraints along a map preserves sieve membership). Supports proof-carrying enumeration: external generators propose candidates plus certificates that Lean verifies. Mechanized in Lean 4 as the Sieve library with zero sorry and no custom axioms; a toy domain (small rewriting systems) illustrates the engine.

Zenodo (PDF + DOI)

Paper 35 — Oracles as External Selectors

NEMS constraints on hypercomputation and physical computability.

Constrains the physical realizability of oracles and hypercomputers in a PSC universe with stable records and diagonal capability. Delivers three headline results: (1) Oracle-as-Selector Theorem (Closure) — any oracle that decides a predicate not determined by the observational quotient is formally an external selector injecting free bits unless its provenance is internalized. (2) No Internal Hypercomputer Theorem (SelectorStrength) — in a diagonal-capable PSC universe with stable records, no total-effective internal procedure can decide halting or record-truth-like predicates; a "halting oracle machine" cannot be physically realized as an internal device. (3) Hypercomputation Taxonomy — any hypercomputer claim forces at least one escape regime (non–diagonal-capable fragment, unstable records, non-extensional predicate, non-total or non-effective selection, or PSC violation). The taxonomy serves as an audit tool for exotic proposals (CTCs, Malament–Hogarth spacetimes, black-hole decoders). Papers 36 (Arrow of Time), 37 (Chronology Under Closure), and 38 (Black Hole Information) apply this machinery.

Zenodo (PDF + DOI)

Paper 36 — The Arrow of Time from Closure

Stable records, no-overwrite, and the necessity of irreversibility in PSC universes.

Proves that stable records force an arrow of time at the level of semantics. Defines record filtration (Visible at time t), stage world-types, and forgetful maps. Proves: (1) Arrow as refinement — monotone record growth ⇒ later stages refine earlier; strict growth ⇒ forget not injective. (2) No-overwrite — dynamics that flips a stable record at stage t forces non-categoricity at t. (3) Irreversibility — no stage-preserving involution can undo refinement without overwrite or selection. (4) Selection barrier for retrodiction — under diagonal capability, selecting among consistent pasts cannot be total-effective internally. Papers 37 (chronology) and 38 (black holes) appear as corollaries. Mechanized in Lean 4 as ArrowOfTime (RecordFiltration, Refinement, strict_refinement, no_overwrite_implies_not_categorical, no_global_reversal, selection_barrier_retrodiction, Toy); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 37 — Chronology Under Closure

NEMS constraints on admissible time travel.

Applies NEMS/Closure and the hypercomputation taxonomy (Paper 35) to admissible time travel. Models evolution as a feedback operator on histories; self-consistent loops = fixed points modulo observational equivalence (Deutsch/Novikov). Proves: (1) Record non-overwrite theorem — overwriting stable records forces non-categoricity (branching); selection required; internal selection constrained by barrier. (2) Selection barrier for chronology — under diagonal capability, selecting among consistent loops cannot be total-effective internally (Paper 29 barrier). (3) Taxonomy: contradiction vs fixed-point vs branching; only closure-compliant options admissible. Mechanized in Lean 4 as ChronologyUnderClosure (record_non_overwrite, selection_barrier_chronology); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 38 — NEMS Constraints on Black Hole Information

Applies PSC and diagonal-capability constraints to the black hole information problem.

Applies NEMS/Closure and the hypercomputation taxonomy (Paper 35) to black hole information. PSC forbids information "lost outside" or true destruction without internal closure. Proves: (1) Record consistency (abstract) — erasing appearance ⇒ not categorical (selection required); a selector exists classically (Choice); internal/effective selector constrained by barriers. (2) No hypercomputing from black holes — no internal total-effective BH decoder for diagonal-capable predicates. Observer-relative records (complementarity) and islands/Page curve interpreted as closure-driven reassignment. Mechanized in Lean 4 as BlackHoles (record_consistency_abstract, no_hypercomputing_from_bh); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 39 — Probability as Closure in General Probabilistic Theories

Uniqueness and rigidity of state assignment from auditability principles.

Proves that under closure-style constraints (context-independence of effects, additivity, normalization), probability assignments in general probabilistic theories (GPTs) are not free but forced: any assignment satisfying these principles corresponds to a unique affine state functional on effects; if effects span the space, this extends uniquely to a linear functional. States are determined by agreement on all effects (extensionality) and on a spanning set. The quantum Born rule is the instance for matrix-ordered spaces. A dedicated bridge module (GPTClosure/Instances/QuantumFinite.lean) connects Paper 13's quantum formalization (NemS.Quantum) with the GPT framework, showing that finite-dimensional quantum probability is an instance of closure-forced probability: the PSD cone defines an ordered unit space, the Born rule equals the GPT state-effect pairing (born_rule_is_gpt_prob), and POVMs map to GPT measurements (povmToMeasurement); state uniqueness follows from the GPT uniqueness theorem (quantum_state_uniqueness). Mechanized in Lean 4 as GPTClosure (ordered unit space, effects, states, measurements, state_ext_effect_span, uniqueness_under_spanning, closure_implies_state, Toy, QuantumFinite); 3 documented sorrys in QuantumFinite (PSD cone pointedness, Born-rule nonnegativity, wiring to busch_gleason_unique), 0 sorry in all other GPTClosure modules, no custom axioms.

Zenodo (PDF + DOI)

Paper 40 — Institutions Under Diagonal Constraints

Minimal role sets, robust audit protocols, and the impossibility of universal self-governance.

Scales the diagonal/self-trust barrier to institutions: protocolized governance with roles, threat models, and minimality. Proves: (1) No universal final judge — under anti-decider closure and hFP, no institution can be total+sound+complete on nontrivial claim families. (2) k-role lower bound — under a k-way partition and role-type constraint, any protocol achieving full certified coverage needs at least k roles. (3) Diversity necessity — strict robustness improvement under admissible protocols implies at least two non-equivalent roles (generalizing Paper 31). (4) Meta-barrier — the institution cannot universally self-certify if diagonal-capable. Defines institutions as verification protocols with roles, coverage sets, and admissibility (no hallucination). Mechanized in Lean 4 as InstitutionalEpistemics (no_universal_final_judge, k_role_lower_bound, diversity_necessity, meta-barrier, ToyRegulation); 0 sorry, no custom axioms.

Zenodo (PDF + DOI)

Paper 41 — Refinement Flow of World-Types

Time as growth of stable distinguishability.

Reframes Paper 36's record filtration and stage world-types as a refinement flow: time as growth of stable distinguishability. Extends ArrowOfTime with iterated forget maps (forgetFromTo from any later stage t′ down to any earlier t), proves coherence (forgetFromTo sends quotient at t′ to quotient at t) and naturality (composition of forgets along a chain equals forget over the interval). Toy witness: two-bit world with strict growth at t=0. Mechanized in Lean 4 as RefinementFlow (forgetFromTo, forgetFromTo_coherent, forgetFromTo_naturality, ToyBits); 0 sorry, no custom axioms. Builds on ArrowOfTime (Paper 36).

Zenodo (PDF + DOI)

Paper 42 — Record Entropy and Noncomputability

Monotone semantic complexity under diagonal capability.

Defines record entropy H(t) as the cardinality of stage world-types at time t—a semantic measure of record complexity. Proves monotonicity (H(t+1) ≥ H(t)) from surjectivity of the forget map and strict monotonicity when refinement is strict. Establishes a uniform entropy decision barrier: the predicate T(c) := (EntropyOfCode(c) = n(c)) on codes (encoding filtration, t, n) is extensional and nontrivial; under anti-decider closure and fixed-point premise, no total-effective decider exists for T over encoded instances. Toy witness: two-bit filtration with H(0)=2, H(1)=4; monotone, strict at t=0. Mechanized in Lean 4 as RecordEntropy (recordEntropy, recordEntropy_monotone, recordEntropy_strict, UniformEntropyBarrier: EntropyCode, entropyOfCode, uniformEntropyClaim, no_total_decider_uniform_entropy, ToyEntropy); 0 sorry, no custom axioms. Builds on ArrowOfTime (Paper 36), RefinementFlow (Paper 41), SelectorStrength (Paper 29).

Zenodo (PDF + DOI)

Paper 43 — Adjudication as Decoding: Semantic Error-Correction under PSC Closure

The universe as a semantic error-correcting code; adjudication as decoding.

Reinterprets internal adjudication (the IIb/PT layer) as decoding and repair of semantic inconsistency in distributed records. Formalizes record fragments as codeword-like constraints and a uniform decoder-claim predicate on encoded instances. Under the SelectorStrength barrier schema (Paper 29), no total-effective decider exists for this predicate over encoded instances when anti-decider closure and a fixed-point premise hold. Stratified decoding is possible; societies improve decoding coverage, and role diversity is necessary for strict improvement (Paper 40). A minimal toy witnesses multiplicity of decoders and the effective constraint. Builds on RecordEntropy (Paper 42), InstitutionalEpistemics (Paper 40), SelectorStrength (Paper 29).

Zenodo (PDF + DOI)

Paper 44 — Calibration as Closure

Laws as compression fixed points under no-free-bits; the calibration principle.

Formalizes "laws" as stable fixed points of an internal law-update operator driven by closure constraints, keeping minimality abstract (no MDL commitment). Multiplicity of fixed points implies a selection problem. Under the SelectorStrength barrier schema (Paper 29), no total-effective decider exists for the uniform law-selector claim over an encoded family of law-update instances when anti-decider closure and a fixed-point premise hold on the code domain. Stratified law selection on restricted fragments remains possible. A minimal toy witnesses multiplicity and the effective constraint. Builds on No-Free-Bits (Paper 27), SelectorStrength (Paper 29), ErrorCorrecting (Paper 43).

Zenodo (PDF + DOI)

Paper 45 — Local Dynamics, Global Semantics: A Closure Engine for Semantic Nonlocality

A closure engine for semantic nonlocality from local dynamics.

Adopts a strong locality axiom at the Holds level: factorization — global satisfaction of observational propositions is the conjunction over fragments of a local predicate applied to the restricted world. This is algebraic, not geometric; no spacetime structure is assumed. Under factorization, same local views (same restriction at every fragment) imply observational equivalence; hence world-type is determined by the global map from fragments to local views. Interpretation: local dynamics alone do not guarantee local semantic closure; semantics is glued globally. Establishes the formal engine that Paper 46 then uses to derive effective nonlocality. Builds on world-type machinery (Papers 33, 41, 42).

Zenodo (PDF + DOI)

Paper 46 — Causal Nonlocality from Closure

A no-go for naive semantic locality under PSC and diagonal capability.

Under PSC-style closure, stable records, and diagonal capability (Papers 27, 29), proves that one cannot simultaneously hold a strong factorization locality axiom (Paper 45) and local semantic determinacy — the condition that world-type is computed from local views in a total-effective way. Proves a no-go: any such procedure would decide an extensional nontrivial predicate on a diagonal-capable domain and thus contradict the selector-strength barrier. So total-effective local semantic determinacy must fail (factorization can hold). This is semantic nonlocality in the effective sense, without implying superluminal signalling. Builds on SemanticNonlocality (Paper 45), FTLConstraints (Paper 47), SelectorStrength (Paper 29).

Zenodo (PDF + DOI)

Paper 47 — No Spooky-to-Signal Compiler

EPR correlations cannot be total-effectively upgraded to FTL signaling.

Proves a theorem-grade constraint on FTL: no total-effective internal procedure can implement a total-effective signalling extractor (a decider for a nontrivial extensional predicate of the globally glued semantics) without amounting to an internal oracle or selector. Defines a spooky-to-signal compiler for predicate T as a total decider for T (not merely correlated); the Paper 29 barrier yields that no such compiler exists. So EPR-style correlations cannot be total-effectively upgraded to controllable signalling—a NEMS-native reframing of "why EPR ≠ FTL." Mechanized in Lean 4 as FTLConstraints (SpookyToSignalCompiler, no_spooky_to_signal_compiler, ToyEPR); 0 axioms.

Zenodo (PDF + DOI)

Paper 48 — Holography Under Closure

World-type duality, no-free-bits reconstruction, and limits of boundary decoding.

Formalizes holography as a closure-preserving interpretation between bulk and boundary observational semantics (Paper 27: worldMap, obsMap, satisfaction preservation). Proves: (1) World-type holography (T48.1): boundary can determine bulk up to observational equivalence via a surjective world-type map. (2) No-free-bits reconstruction (T48.2): deciding a non-invariant bulk predicate from boundary world-types violates audit soundness; extra decoding bits are selectors unless internalized. (3) No total-effective boundary decoder (T48.3): an internal total-effective reconstruction that decides a nontrivial extensional bulk predicate on a diagonal-capable fragment would violate the Paper 29 barrier. (4) Taxonomy (T48.4): any holography claim lands in H0–H4. Mechanized in Lean 4 as HolographyUnderClosure; 0 axioms.

Zenodo (PDF + DOI)

Paper 49 — Cosmic Audit: Universe as a Self-Auditing Institution

Distributed adjudication networks forced by record closure.

Universe as a self-auditing institution: forced distributed adjudication (T49.1) and diversity necessity for strict improvement (T49.2). CosmicAudit lives inside InstitutionalEpistemics; uses Role and protocol aggregation. Mechanized in Lean 4; 1 sorry in Examples.ToyCosmic.

Zenodo (PDF + DOI)

Paper 50 — A Complete Logic of Certification

Soundness, completeness, and maximality for stratified verification protocols.

Stratified certification calculus with nontrivial semantics (CertifiableAt = coverage sense). Proof system ⊢_S mirrors protocol combinators. T50.1 Soundness: every derivation yields a protocol witness. T50.2 Completeness: every protocol witness normalizes to a derivation (normal-form theorem, protocolCoverage_subset_union_atoms). T50.3 Maximality: any extension yielding a total decider for an extensional nontrivial predicate on a diagonal-capable domain contradicts the Paper 29 barrier. Toys: Fin 4 (toy_equiv), Nat boundary (toy_boundary, parametric in hFP). Build: full lake build from nems-lean root. 0 axioms.

Zenodo (PDF + DOI)

Paper 51 — Necessary Incompleteness of Internal Semantic Self-Description

The non-self-erasure theorem and semantic remainder in reflexive systems.

Defines a self-semantic frame: a family of internally encoded claims whose truth is the realized semantic truth of the system itself. Proves the flagship theorem: no sufficiently expressive diagonally capable realized system can internally contain a final theory (internal, total, and exact) of its own realized semantics. Rules out internal semantic self-exhaustion. Introduces weak self-erasure (final self-theory whose verdict behavior lies inside the self-semantic claim family) and strong self-erasure (exact internal semantic image closed under self-application); both ruled out as corollaries. Proves the positive master statement: every internal self-theory either fails totality or leaves an irreducible semantic remainder. Yields the general non-self-erasure principle: reflexive closure does not collapse a system into pointlike self-identity. Physical corollary: no final internal GUT. Mechanized in Lean 4 as SemanticSelfDescription; 0 sorry, no custom axioms. Builds on SelectorStrength (Paper 29), Reflection (Paper 28), SelfReference (Paper 26). Cross-reference (§F): quotient-section realizability (Paper 27 / Paper 78) is a structurally parallel obstruction—no total-effective quotient section under diagonal capability (QuotientSectionBridge.halting_framework_no_computable_section). The concrete halting-framework instance: no computable decider for any nontrivial extensional predicate (e.g. halts-on-zero) on the halting framework (QuotientSectionStrength.halting_framework_no_decider_at_computable). Downstream: Paper 72 (Constraint Theory of Autonomous Agency) imports NoFinalSelfTheory and discharges mirror non-exhaustion as a theorem.

Zenodo (PDF + DOI)

Paper 52 — Direct Self-Semantic Fixed Points

Intrinsic diagonal claims against final internal self-theories.

Upgrades Paper 51 from reduction-to-barrier into an intrinsic theorem: constructs the contradiction directly inside the self-semantic framework. Introduces semantic negation on claims, a self-reference frame for code-level fixed points, and anti-verdict claims. Proves that under these hypotheses there exists a fixed-point code \(d\) such that \(\Decode(d)\) is semantically equivalent to the anti-yes claim for \(T\) on \(d\); a putative final self-theory yields contradiction in every branch. Derives direct no-weak-self-erasure and no-strong-self-erasure corollaries. Mechanized in Lean 4 as SemanticSelfReference; bridges back to Paper 26.

Zenodo (PDF + DOI)

Paper 53 — Syntax Cannot Exhaust Semantics

A no-reduction theorem for reflexive systems.

Proves that no purely syntactic internal structure can be total and exact for realized semantic truth in a diagonally capable reflexive system. Defines syntactic theory-objects, semantic adequacy, and semantic exhaustiveness; proves that syntactic semantic exhaustion would induce a final self-theory and thus yield contradiction. Includes comparison with Tarski-style truth undefinability. Mechanized in Lean 4 as SyntaxSemantics.

Zenodo (PDF + DOI)

Paper 54 — Observers, Minds, and Reflexive Non-Self-Exhaustion

An observer corollary of the no-final-self-theory theorem.

Proves that no reflexive observer can internally exhaust itself as a complete semantic object. An observer that could do so would possess a final internal self-theory; by Papers 51–52, no such theory exists. Blocks only total self-exhaustion; stratified observer models and mirror-improved coverage remain available. Observerhood requires semantic remainder, external mirror, or selector structure under diagonal capability.

Zenodo (PDF + DOI)

Paper 55 — Qualia and the Semantic Ledger

A formal dissolution of the hard problem of consciousness.

Proves that any qualitative content known by a subject must be represented in the semantic ledger; once represented, it cannot be reduced to purely syntactic content (Paper 53). Hence any viable account of qualia must treat them as irreducible semantic ledger content. The traditional hard problem, construed as demanding syntax alone to generate qualia from outside the ledger, is category-mistaken. Mechanized in Lean 4 as QualiaLedger; depends on SyntaxSemantics and SemanticSelfReference.

Zenodo (PDF + DOI)

Paper 56 — The Reflexive Closure Theorem

Closure without collapse in reflexive systems.

Unifies Papers 51–55 into the Reflexive Closure Theorem: a nontrivial reflexive system may close over itself, but cannot coincide with its own complete internal semantic image. Closure is possible (self-return, partial self-articulation, semantic remainder); collapse is impossible (no total self-exhaustion, no self-coincidence). Defines self-coincidence and irreducible reflexive distance. Mechanized in Lean 4 as ReflexiveClosure; depends on SemanticSelfReference, SyntaxSemantics, QualiaLedger.

Zenodo (PDF + DOI)

Paper 57 — The Reflexive Unfolding Theorem

Frontier generation and why there is change.

Turns the static summit (Paper 56) into a dynamic theorem: every achieved closure generates new semantic frontier, so reflexive unfolding cannot halt. Proves no terminal reflexive completion under diagonal capability. Cosmological corollaries: no null origin, no null terminus, no external null boundary. Bridges to RefinementFlow (Paper 41) and RecordEntropy (Paper 42).

Zenodo (PDF + DOI)

Paper 58 — Necessary Reflexive Intelligence

Why nontrivial reflexive worlds are not random or robotic.

Proves that nontrivial reflexive worlds are neither dead mechanism nor brute randomness, but necessarily adjudicative: lawful non-algorithmic selection. Under frontier-sensitive self-model-bearing closure, such worlds exhibit minimal reflexive intelligence in a structural sense. Bridges to nems-lean NemS.Adjudication (Papers 15, 19, 22).

Zenodo (PDF + DOI)

Paper 59 — A Calculus of Intelligence

Frontier, adjudication, and self-modeling in reflexive systems.

Provides a formal calculus of intelligence: intelligence levels coincide with the chooser hierarchy; without frontier, there is no nontrivial intelligence; frontier-bearing reflexive systems admit precise intelligence levels; distributed diversity strictly amplifies certified intelligence coverage. Proves terminal reflexive completion implies no minimal reflexive intelligence. Bridges to Paper 31 (EpistemicAgency).

Zenodo (PDF + DOI)

Paper 60 — Reality as Recursive Intelligence

The final theorem of reflexive closure, frontier, and adjudication.

Unifies Papers 56–59 into one master theorem: a nontrivial reflexive reality cannot close as static self-identity; it persists as recursive frontier-generation through lawful internal adjudication, and is therefore recursively intelligent in a structural sense. Defines nontrivial reflexive reality and recursive intelligence; proves the final theorem of reflexive reality.

Zenodo (PDF + DOI)

Paper 61 — Ghost Collapse and Ledger Finality

Why off-ledger being is either illicit or null.

Proves that any purported off-ledger entity is either determinacy-relevant (hence illicit under no-free-bits, Paper 27) or semantically inert (hence theory-null). No viable ontology of real-but-off-ledger ghost entities survives. Bridges to Paper 27 (no-free-bits) and Paper 55 (QualiaLedger).

Zenodo (PDF + DOI)

Paper 62 — No Self-Actualizing Ledger

Syntax, semantics, and same-level completion cannot ground reality.

Proves that no articulated ledger can be the full sufficient ontological ground of its own actuality. Syntax cannot ground it (Paper 53). Object-level semantics cannot ground it (circular). Equal-status external completion cannot ground it (Paper 23). Self-actualizing ledger cannot ground it (circular). Corollary: grounding squeeze—any adequate ground must be of a different category.

Zenodo (PDF + DOI)

Paper 63 — The Alpha Theorem

The necessary ontological ground beyond syntax and semantics.

Proves that if nontrivial reflexive reality exists, then there must exist a necessary pre-categorial ontological ground of its actuality. We call this ground Alpha. Derives ground existence from no-free-bits (Papers 27, 61) and the grounding squeeze of Papers 61–62. 0 sorry, 0 axioms in Alpha.

Zenodo (PDF + DOI)

Paper 64 — Primordial Ground and Grounded Existence

Whatever exists is Alpha-grounded; Alpha is the unique pre-categorial ontological ground.

Unfolds consequences of the Alpha theorem: whatever exists is Alpha-grounded, and Alpha is characterized structurally—not grounded by same-level other, not object-level, not temporalized, primordial, not null, and not mere infinity. Formal theory of grounded existence.

Zenodo (PDF + DOI)

Paper 65 — Qualia as Alpha-Grounded Semantic Content

Known qualia are irreducible semantic content whose actuality is Alpha-grounded.

Proves the safe theorem (Layer A): known qualia are irreducible semantic content whose actuality is Alpha-grounded. Composes Papers 53 (syntax cannot exhaust semantics), 55 (qualia on-ledger), 63 (Alpha exists), 64 (whatever exists is Alpha-grounded). The stronger manifestation thesis (Layer B) is reserved for the next arc and is bridge-dependent. 0 sorry, no bridge axiom.

Zenodo (PDF + DOI)

Paper 66 — Phenomenal Presence and Ground-Manifestation

From Alpha-grounded qualia to the manifestation theorem.

Proves that known qualia are Alpha-manifestations: phenomenal presence and ground-mode bridge known qualia to Alpha. Defines phenomenal presence independently of ground-mode; proves that phenomenally present, irreducible, Alpha-grounded content is in ground-mode; defines Alpha-manifestation as ground-mode with phenomenal presence. Proves the non-collapse theorem: there exist Alpha-grounded entities that are not Alpha-manifestations. Depends on Papers 53, 55, 63, 64, 65.

Zenodo (PDF + DOI)

Paper 67 — Awareness as the Locus of Ground-Presence

Why conscious presence is not an object in the world.

Defines awareness as the locus at which Alpha-grounded reality is present as experience. Proves that Alpha-manifestation implies presence at an awareness-locus; establishes existence of an awareness-locus that is a locus of Alpha-presence. Proves that awareness-locus is not object-level content. Derives self-illumination of realized awareness from the awareness structure (via Paper 33). Depends on Papers 66, 33.

Zenodo (PDF + DOI)

Paper 68 — Alpha Is Not Null

Ground, presence, and the refutation of nihilistic emptiness.

Refinement and anti-misreading theorem: separates ObjectEmpty, Null, SemanticallySterile, and Inert as distinct predicates. Proves Alpha is object-empty but not null, not sterile, and not inert. Blocks the nihilistic interpretation of Alpha as sheer absence, the passive-backdrop reading, and the sterility attack. Does not contradict Paper 64; disambiguates and strengthens. Depends on Papers 64, 66, 67.

Zenodo (PDF + DOI)

Paper 69 — Reality, Existence, and Awareness

The unified theorem of ground, articulation, and manifestation.

Unifies ground, articulation, and manifestation-in-awareness as three coordinated aspects of one structured ontological fact. Proves reality is Alpha-grounded (69.1), world-process is Alpha-grounded recursive articulation (69.2), qualia and awareness are Alpha-grounded manifestation-in-awareness (69.3), and three-aspect coordination (69.4). The synthesis recapitulates Paper 56's minimal ternary closure form at the ontological level (69.T). Depends on Papers 60, 64, 66, 67, 68; structurally integrates Paper 56.

Zenodo (PDF + DOI)

Paper 70 — The Golden Bridge

The final unification of ground, being, and awareness.

Crown paper: states the final integrated theorem and explicitly dissolves the false dilemmas—hard problem, object-search for consciousness, Alpha as nihilistic nullity, syntax-only exhaustivism, world/awareness alienation. Ground, Articulation, and Manifestation-in-Awareness are coordinated irreducible aspects of one primordial ontological fact. Imports Theorem 69.4 as the final statement; no new machinery. The final triad is the mature ontological recurrence of Paper 56's minimal ternary closure form. Includes the self-illumination culmination: in realized awareness, Alpha-presence is self-illuminating without becoming dualistically split.

Zenodo (PDF + DOI)

Paper 71 — Viable Continuation Under Constraint

A general theory of stability, pathology, and collapse across reflexive systems.

Introduces and proves a general theorem framework for systems whose persistence depends on reconciling local transitions with whole-system viability. Defines an abstract ontology of record-bearing constrained systems, a relational measure layer, and a theorem spine in three levels: foothill theorems (local defects defeat system-level robustness), ridge theorems (four principal routes to failure: proxy drift, local-global pathology, correlated failure, constraint deficit), and a summit abstraction, BoundaryDefect, with a theorem pair establishing a general viability boundary. Nine domain bridges (AGI, law, biology, civilization, war, pluralism, ecology, science, physical regimes) are instantiated in both markdown and Lean schemas; FrontierPrinciples (Phase VII+) maps the frontier canon to defect witnesses. Appendices A–C provide theorem-ascent overview, bridge schema mappings, and canonical principles. The abstract theorem family is fully proved in Lean (zero sorry); nine Lean bridge schemas plus FrontierPrinciples each prove LocalGlobalDecoupled.

Zenodo (PDF + DOI)

Paper 72 — Structural Principles of Stability, Pathology, and Collapse

Canonical principles of viable continuation across reflexive systems.

Companion to Paper 71. Paper 72 collects canonical principles of viable continuation across reflexive systems into a structured canon organized by domain: AGI, civilization, pluralism, war, science, biology, ecology, markets. Each principle is formalized in the principle environment, cited with formal anchors, and mapped to defect witnesses in the Lean artifact via FrontierPrinciples.lean. The paper provides the human-readable interface to the frontier canon; the Lean bridge supplies machine-checked LocalGlobalDecoupled and common-mode failure proofs per principle. See FRONTIER_BRIDGE_TARGET_LEDGER.md for the full ledger.

Zenodo (PDF + DOI)

Paper 73 — The Constraint Theory of Autonomous Agency

Self-indexing manifolds and the boundaries of unified systems.

Formalizes the Self-Indexing Adjudicative Manifold (SIAM) as a bounded dynamical regime in phase space—a specialized unified-agent regime inside the proved closure/selection/diagonal framework. Defines O-SIAM via seven structural invariants with witness-carrying structures, timescales, Master Bottleneck, openness band, and topology on ReconciliationSimplex. All load-bearing theorems proved: summit (osiam_collapse_at_boundary), mirror non-exhaustion (from Paper 51), burden–VC capacity, ridge pathology mapping, separation (feedforward_not_OSIAM, stateful_not_OSIAM, robust_SIAM_implies_unified; non-vacuous definitions). Maps SIAM pathologies to Paper 71 defects via explicit embedding ι and toVCDefectProfile. DSAC validation via sentience-compute (10 scenarios, TDA reconciliation/unity modes, burden decomposition, ablations, non-examples). P-SIAM (phenomenological extension) demoted to appendix.

Zenodo (PDF + DOI)

Paper 74 — The Formal Structure of Phenomenology

Qualia, manifestation, and selector-access regimes.

Develops the formal phenomenology layer extending the operational boundary theory of Paper 73 (O-SIAM). Introduces a six-part ontology, distinguishes primitive from induced structure, and defines matter, mind, qualia, self, and common world as regime-cuts. Proves anti-collapse theorems (articulation insufficient, manifestation not reducible, locus irreducible; off-ledger strategies illicit or semantically null under bridge premises). Formalizes ownership, typed manifestation, locus-dependence, selector-access regimes, and bounded restriction-relaxation. Proves coherence theorems and a unified explanatory schema: one machinery explains private manifestation, owned content, self-presence, structured qualia, and selector-access differences. Physics coupling is out of scope. Appendix A: Claim Typing and Flagship Theorem Spine Audit.

Zenodo (PDF + DOI)

Paper 75 — The Uniqueness of the Phenomenology Framework

Uniqueness, categoricity, and survivor selection for closure-compatible phenomenology.

Develops the uniqueness program for the formal phenomenology framework. Defines admissible theory-space 𝔗, stratification (ground sieve, among-survivors, reconstruction), theory-equivalence ∼. Proves elimination over rival classes; reconstructs six-part structure from admissibility; proves the Paper 74 framework is uniquely selected survivor up to ∼. Machine-checked in phenomenology-lean (Phenomenology.Meta, Admissibility, SelfRisk, Paper74Audit).

Zenodo (PDF + DOI)

Paper 76 — A Formal Theory of Transputation

Closure, internal adjudication, and non-algorithmic continuation selection.

Defines transputation as the internal adjudicative layer forced under closure and record-divergent choice in diagonal-capable frameworks. Establishes that ordinary total-effective computation is insufficient for continuation-selection; an internal adjudicator is required. Proves the forcing theorem (closure + choice ⇒ internal adjudicator), the diagonal barrier (record-truth not computably decidable), and the no-collapse theorem (adjudicator not replaceable by total-effective decider). Provides realization criteria (Section 8) for implementations. All flagship theorems machine-checked. Companion Paper 77 presents DSAC as a candidate realization family.

Zenodo (PDF + DOI)

Paper 77 — DSAC as a Realization of Transputation

A candidate architecture for internal adjudication under closure.

Presents DSAC (Delta Self-Adjudicative Computation) as a candidate realization family for transputation. Maps the Δ-machine architecture (continuous lattice, reflexive constraint graph, scenario-driven execution) to Paper 76's realization criteria. Distinguishes operational vs. formal closure; explains why DSAC is not merely a heuristic optimizer. Validation evidence from SAT, Max-SAT, constraint discovery, metric closure, and TSP. Supported by abstract interface-level formalization: dsac_witness_instantiates_realization, operationally_closed_implies_non_externalized, dsac_step_deterministic, witness_transport, scenario-class fit theorems. DSAC is not the definition of transputation; it demonstrates that the abstract class admits concrete implementation.

Zenodo (PDF + DOI)

Paper 78 — Second-Law Grounding from Closure

Record refinement, hidden history, and the structural preconditions of thermodynamic irreversibility.

Develops the second-law grounding arc of the NEMS program: identifies record-theoretic asymmetries forced by closure-compatible refinement and proves monotonicity theorems in Lean. Track 1: record-resolution monotonicity (observational equivalence classes cannot decrease under refinement). Track 2: hidden-history fiber monotonicity (fiber size over later visible class cannot exceed earlier fiber under forgetful map). Structural irreversibility is already in ArrowOfTime; this paper connects record-resolution and hidden-history monotonicity to the unified closure architecture. Thermodynamic interpretation remains conceptually supported but not fully reduced.

Zenodo (PDF + DOI)

Paper 79 — Foundational Admissibility

Closure as a selection principle on cosmological possibility space.

Proves that closure compatibility and foundational viability are equivalent: \(\FndViable(U) \Leftrightarrow \ClosureCompat(U)\). Defines \(\FndViable(U)\) as conjunction of closure-admissible initiality, structural irreversibility, and closure-realized history; \(\ClosureCompat(U)\) as nonemptiness of the cosmological closure schema. Proved by foundational_admissibility and foundationally_viable_implies_closure_compatible. Establishes closure compatibility as the first selection sieve on cosmological possibility space. Defines survivor compatibility, probabilistic admissibility, and physics-architecture admissibility as post-admissibility cascade stages.

Zenodo (PDF + DOI)

Paper 80 — The Classification Cascade for Foundational Universes

Survivor selection from closure to physics architecture.

Formalizes the next arrows in the classification cascade with structure-tied predicates: survivor compatibility \(\Rightarrow\) probabilistic admissibility \(\Rightarrow\) physics-architecture admissibility. Defines \(\CascadeCompat(U)\) and \(\NarrowSurvivor(U)\); proves survivor-compatible frameworks with nonvacuous worlds land in the narrow survivor class. Main theorems: ClosureForcedProbabilityStructure, ClosureCalibratedLawStructure, survivor_filter_narrows_class, survivor_compatible_implies_cascade_compatible. Does not yet yield final narrow-survivor or near-categoricity theorem.

Zenodo (PDF + DOI)

Paper 81 — Big Results from the NEMS Program

Flagship theorems across nine thematic arcs: logic, physics, quantum mechanics, computation, epistemology, ontology, and reflective certification. Updated April 2026.

Synthesis paper stating flagship results of the NEMS program across nine thematic arcs (updated April 2026): (I) Logic and Mathematics—including the Closure Without Exhaustion two-route summit (Paper 91) and the Internality/Outsourcing Schema (Papers 82–83); (II) Cosmology and Spacetime—physical incompleteness, semantic floor, foundational finality, closure arrow of time, second-law grounding (now Earned, Paper 78), grand unification, foundational admissibility, classification cascade with Survivor Calculus backbone (Paper 84), quotient-section realizability, semantic terminality, quantum gravity, chronology, black holes, holography; (III) Gauge Theory and Standard Model; (IV) Quantum Mechanics and Probability; (V) Computation and Realizability; (VI) Epistemology and Agency; (VII) Ontology and Consciousness; (VIII) Applied Boundary Theory—including Admissible Continuation (Paper 85); (IX) Reflective Certification and Non-Exhaustion—canonical certification, enriched realization, reflective non-exhaustion summit, and external validation (Infinity Compression program, infinity-compression-lean). All arcs now Earned. Foundational Admissibility (79), Classification Cascade (80), and Survivor Calculus (84) close the cosmological loop; Closure Without Exhaustion (91) closes the self-theory arc. Zenodo: 10.5281/zenodo.19429891 (concept DOI, always latest).

Zenodo (PDF + DOI)

Paper 82 — Meta-Principles of Closure, Admissibility, and Internal Burden

Determinacy without outsourcing: the meta-principles governing the NEMS program.

Typed synthesis paper extracting ten meta-principles from the NEMS theorem spine, with explicit claim-typing (theorem-extracted, schema-level, interpretive) and named formal anchors for eight of the ten. Central thesis: load-bearing determinacy cannot be illicitly outsourced. The ten meta-principles are: (1) No Free Determinacy — InternalitySchema.outsourcing_barrier; (2) Fundamentality as Internal Completion — Foundationality.foundational_iff_internal_completion (new: Foundational ↔ ObsCategorical ∨ ∃ internal selector); (3) Internalization Does Not Mean Totalization — InternalizationNotTotalization.internalization_not_totalization (new: under barrier premises, total exhaustive internal completion fails); (4) Forced Adjudication — ForcedAdjudication.forced_adjudicative_role; (5) Structural Incompleteness — StructuralNonExhaustibility.no_total_exhaustion_of; (6) Hypercomputation as Premise Audit — Hypercomputation.internal_hypercomputer_claim_forces_premise_failure; (7) Closure-Compatible Continuation — AdmissibleContinuation.closure_compatible_continuation; (8) Foundational Survivorship — SurvivorCalculus.residual_inclusion; (9) Distributed Burden Requires Structured Diversity — EpistemicAgency.diversity_necessary; (10) Reality as Closure-Constrained Burden-Bearing (interpretive). Includes a summary table mapping all ten principles to status and primary formal anchor. Does not itself present new foundational theorem developments; organizes and interprets what the suite jointly expresses, and notes subsequent abstract formalizations of the extracted meta-principles. Companion to Paper 81 (theorem survey).

Zenodo (PDF + DOI)

Paper 83 — The Internality / Outsourcing Schema

A general Lean theory of load-bearing tasks.

Formalizes the core structural pattern underlying many NEMS results as an abstract reusable schema. Introduces the SystemTaskInterface (types: System, Task, Structure; predicates: LoadBearing, InternallyRealizable, CompletedBy, InternalTo; bridge axiom: completion by internal structure implies internal realizability) and proves the Generic Outsourcing Barrier: if a task is load-bearing and not internally realizable, any completion witness is non-internal. Proves the Outsourcing Witness corollary. Instantiates the schema for the NEMS framework, recovering the trichotomy (categorical / internal selector / needs external selection) as a corollary (nems_recovery). Formalizes Fundamentality as Internal Completion (Meta-Principle 2 of Paper 82): a framework is foundational iff it is observationally categorical or has an admissible internal selector (foundational_iff_internal_completion). Sketches three application instances: no-free-bits (Paper 27), oracle-as-selector (Paper 35), and forced adjudication (Paper 8). Companion formalization paper for Paper 82.

Zenodo (PDF + DOI)

Paper 84 — The Survivor Calculus

A generic admissibility cascade for theory spaces.

Formalizes the admissibility cascade underlying the NEMS cosmological program as a generic abstract framework. Defines a Cascade as a list of constraints on a base space and residual classes $R_k$ as the sets satisfying the first $k$ constraints. Proves the Monotone Cascade Theorem: $R_{k+1} \subseteq R_k$ (via List.take_isPrefix_take and Sieve.residual_mono). Instantiates the cascade for the cosmological application: four stages (closure compatibility, survivor compatibility, probabilistic admissibility, physics-architecture admissibility) yielding a descending chain of viable framework classes. Explains the relation to the Sieve library (Paper 34) and provides a bridge scaffold to NemS.Cosmology.FoundationalAdmissibility (Papers 79–80). Packages the filtering structure of Papers 79–80 into a reusable abstract theory. Companion formalization paper for Papers 79–80 and Meta-Principle 8 of Paper 82.

Zenodo (PDF + DOI)

Paper 85 — Admissible Continuation

Closure-compatible burden-bearing constraints on system evolution.

Formalizes the bridge between closure-compatible determinacy and admissible continuation. Introduces the ContinuationSystem structure (State, Record, Time, holds, update, record-preservation axiom: updates cannot destroy records that already hold). Defines ClosureCompatible and BurdenBearing as abstract predicates and AdmissibleContinuation as their conjunction. Proves the Closure-Compatible Continuation Theorem: ClosureCompatible ∧ BurdenBearing ⇒ AdmissibleContinuation. Interprets the result: the same conditions that constrain static determinacy also determine whether continuation is admissible; systems failing either condition do not have admissible continuation. Connects to the viable-continuation program (Papers 71–72), the ArrowOfTime library (Paper 36), and Meta-Principle 7 of Paper 82 (closure and continuation are coupled). Companion formalization paper for Meta-Principle 7 of Paper 82.

Zenodo (PDF + DOI)

Paper 86 — Reflexive Reality: A Philosophical Exposition

What the NEMS research program tells us about the deepest questions.

Closing philosophical capstone of the NEMS Suite (Paper 86): written for philosophers, scientists, and serious non-specialists rather than as a Lean-forward technical manuscript. Explains Reflexive Reality as the view forced by taking Perfect Self-Containment seriously—closure, the diagonal barrier, physical incompleteness, phenomenology of ground and awareness, and the surviving Alpha / Golden-Bridge picture—using sketch-proofs and suite citation codes ([P63], [RP-RI], etc.) tied to the verified program. Situates the suite relative to Infinity Compression, Reflexive Architecture, Adequacy, RI, RFO, ONE, and the General Science of Reflexive Systems so the full research arc is legible without reading every technical paper.

Zenodo (PDF + DOI)

Paper 87 — Reflexive Reality: A Survey for Formal Theory Specialists

New impossibility results, new proof methods, and a positive science of what happens after impossibility.

Paper C2 of the capstone portal series: audience-specific survey for logic, computability theory, proof theory, type theory, and mechanized mathematics. Organizes the program’s formal-theory contributions into four tracks—new impossibility results (three independent engines and their joint classification); new machine-checked theorems on classical mathematical objects (including group-extension splitting, Quillen Theorem A for Galois connections, and twelve-tranche external validation of a positive-closure proof architecture); the Reflexive Development Law as a positive dynamical classification after impossibility; and a methodology for typed formal synthesis at program scale. Maintains explicit claim-typing (theorem-extracted, bridge, interpretive). Companion portals C3 (physics) and C4 (AI/agents) cover non-formal-audience surveys.

Zenodo (PDF + DOI)

Paper 88 — Reflexive Reality: A Survey for Physicists

What closure proves about the Standard Model, quantum mechanics, and spacetime.

Paper C3 of the capstone portal series: survey of physical results for theoretical physicists (high-energy theory, quantum foundations, quantum gravity, cosmology, statistical mechanics). Thesis-level content includes the Two-Layer PSC theorem (Standard Model gauge structure forced in Layer I, three-generation selection in Layer II, with machine-checked support in nems-lean and ugp-lean), the Born rule as the unique closure fixed point of the probability-assignment problem, the arrow of time as structurally tied to stable records, unified diagonal constraints on black-hole information, holographic encoding, time-travel selection, and FTL non-signaling, parameter-free UGP derivations of couplings and fermion masses where cited as machine-checked, and the classification cascade framing closure compatibility as central to foundational viability. Claim-typing matches C2/C4.

Zenodo (PDF + DOI)

Paper 89 — Reflexive Reality: A Survey for AI, Agents, and AGI Researchers

Theorem-grade constraints on intelligence, agency, safety, and machine consciousness.

Paper C4 of the capstone portal series: theorem-grade constraints for AI, AGI, multi-agent systems, AI safety, cognitive science, and agent foundations—what structural conditions any system must satisfy to qualify for designated properties, and which properties are formally impossible regardless of scale. Headline themes: structural blind spot in parametric self-models; formal SIAM characterization of genuine autonomous agency with separation theorems (e.g. feedforward and stateless systems not qualifying); impossibility of total, sound, and complete institutional AI verification under diagonal constraints; simulation hypothesis closed on three independent grounds; Reflexive Development Law distinguishing real architectural progress from scaling and relabeling; substrate-independent structural characterization of machine sentience. Explicitly not a claim that AI cannot be capable or that current systems are or are not conscious.

Zenodo (PDF + DOI)

Paper 90 — A Continent Map of the Reflexive Reality Program

Structure, dependencies, reader routes, and the role of recent results.

Orientation map for the full program: six major thematic zones (verified NEMS spine; barrier / impossibility engines including RI, RFO, and semantic-type obstruction; ontology and awareness; continuation, agency, and sentience; transputation and realization; summit synthesis), their dependencies, flagship papers per zone, and discipline-specific entry routes for philosophers, logicians, physicists, and AI researchers. Highlights recent machine-checked semantic-type obstruction results (from reflective-fold-obstruction-lean, SemanticType/ modules) bearing on simulation versus realization. Explicitly an architecture chart for navigating the research continent, not a theorem index or literature review.

Zenodo (PDF + DOI)

Paper 91 — Closure Without Exhaustion

A theorem of internal semantic non-exhaustion for reflexive systems.

Flagship statement of internal semantic non-exhaustion for sufficiently expressive reflexive systems: they may close over themselves but cannot admit a final, total, exact internal theory of their own realized semantics; something remains structurally unabsorbed. Sharpens classical incompleteness barriers toward the demand for full internal capture of total semantic truth (not mere unprovability in a fixed formal system). Gives two independent machine-checked proof routes, closure-vs.-collapse discipline, a reusable notion of final internal self-theory, and consequence links to physical incompleteness, non-emulability of execution under record-divergent choice, observer non-self-exhaustion, and syntax–semantics separation; unification corollary treats Gödel, Kleene, Löb, and Tarski-style phenomena under a master fixed-point spine in Lean.

Zenodo (PDF + DOI)

Paper 92 — Consciousness, Phenomenology, and Mind

A formal theory of sentience, qualia, and awareness in Reflexive Reality.

Paper C5 capstone survey of mind and phenomenology for philosophers, cognitive scientists, and serious non-specialists. Central thesis: consciousness has a formal structure uniquely selected under stated admissibility constraints; mind, qualia, awareness, and world are coordinated aspects within one Alpha-grounded fact—not alien substances or mere illusions. Synthesizes the consciousness arc (Papers 51–75): Paper 74’s six-part phenomenology ontology with anti-collapse theorems; Paper 75’s uniqueness / survivor theorem in admissible theory space; Paper 73’s SIAM sentience regime and separation theorems (e.g. feedforward and stateless architectures not qualifying); qualia and awareness-locus results from Papers 55–70; companion to the continent map (Paper 90). Does not settle every phenomenal detail; states the proved architectural skeleton.

Zenodo (PDF + DOI)

Reader On-Ramp: The PSC–Born Fixed-Point Architecture

What is proven, what is assumed, and where disagreement must land.

Zenodo (PDF + DOI)

Significance of the General Self-Reference Calculus

Explanatory note for Paper 26 of the NEMS Suite.

Zenodo (PDF + DOI)

Explanatory Companion Note to Paper 30

Why perfect self-certification is impossible in self-referential systems.

Zenodo (PDF + DOI)

Domain Corollaries of Viable Continuation

Companion to Paper 71: Section 12 and principal appendices.

Zenodo (PDF + DOI)

Certification, Realization, and Obstruction: A Universal Fiber Architecture

Synthesis map of the full program; routes C/A/B/D; cross-domain dictionary.

This paper closes the editorial loop for a multi-manuscript program in machine-checked mathematics. The executive claim is that a single collapse / refinement / fiber architecture---certification at a bare carrier, strict comparison upstairs, obstruction organized as fiber and section data---is instantiated internally in dependent type theory, validated on twelve external mathematical families, and then discharged into algebra, arithmetic (embedding problems), topology (Quillen for Galois connections), and logic/computability (self-certification and halting anchors). We state the role of each companion paper, a cross-domain dictionary, route labels used in the program (C/A/B/D), and what remains open. The intended reader is an advanced mathematician who has not read the series; citations p

Zenodo (PDF + DOI)

External Validation of a Positive-Closure Proof Architecture

Transferability across twelve external mathematical families (T1–T12).

Transferability paper. This manuscript establishes that the positive-closure architecture is exportable to ordinary mathematics outside the flagship Infinity Compression modules; it is not the program map and not the venue for theorem-level leverage in algebra, topology, or arithmetic---those roles belong to the companion general-method papers cited below. The Infinity Compression (\IC{}) formalization develops a layered positive-closure proof architecture: collapse to a bare certificate, a typed forgetful map, fiber structure over that certificate, and, where appropriate, canonical witnesses or sections. A natural methodological concern is that this architecture may be endogenous to the flagship NEMS-style case rather than a reusable proof pattern. This paper presents a consolidated machi

Zenodo (PDF + DOI)

Fiber Architecture for Group Extensions in Lean 4

Cocycles, splitting criterion, and the cohomological bridge.

We present a machine-checked formalization of the section 2-cocycle, splitting criterion, and embedding-problem equivalence for group extensions in Lean 4 , built on Mathlib's \lean{GroupExtension} API . The formalization is organized around a fiber architecture that decomposes extensions into layers: fibers over quotient elements (N-torsors), set-theoretic sections (always exist), and homomorphic splittings (may not exist). The central results are: (1) the splitting criterion---an extension splits if and only if some section has trivial cocycle; (2) the embedding-problem equivalence---an abstract embedding problem (the central lifting problem in inverse Galois theory) is solvable if and only if the associated extension splits, if and only if the cocycle obstruction vanishes; (3) the 2-coc

Zenodo (PDF + DOI)

Quillen's Theorem A for Galois Connections

First machine-checked formalization of Quillen A for Galois connections.

Machine-checked construction of the homotopy data for Quillen's Theorem A in the Galois connection case: nerve maps induced by the lower and upper adjoints, and explicit 1-simplex witnesses (closure edges [p → u(l(p))] and kernel edges [l(u(q)) → q]). The composition-to-identity step requires simplicial homotopy as a Lean type (not yet in Mathlib) and is deferred to future work.

Zenodo (PDF + DOI)

Completing the Cohomological Extension Package

Mathlib companion: section cocycles and splitting criterion for PR reviewers.

Mathlib's GroupExtension/Defs.lean documents two explicit TODO items: a bijection between N-conjugacy classes of splittings and H^1, and a bijection between equivalence classes of group extensions and H^2, both for abelian kernel N. Neither is currently formalized. This technical note documents a proposed Mathlib contribution that constitutes Phase 1 of completing these TODOs: the section cocycle associated to a set-theoretic section of a group extension, the splitting criterion (splits_iff_trivial_cocycle), and supporting infrastructure including the section difference function, the conjugation action via sections, and the multiplicative 2-cocycle identity. All theorems are fully verified by the Lean type checker with zero sorry. We describe the proposed API surface, design decisions (nam

Zenodo (PDF + DOI)

Closure, Realization, and Reflective Residue (Summit 1)

Strata synthesis: NEMS + APS + IC with bridge theorems and the Non-Erasure Principle.

Lean 4 software archive for the NEMS program: Lean Reflexive Architecture. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

The Geometry of What Maps Forget (Summit 2)

Residual kernels and what maps forget: universal fiber architecture for non-injective comparison.

Lean 4 software archive for the NEMS program: Lean Reflexive Architecture. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Representational Incompleteness

No parametric self-model covers its own diagonal; six no-escape routes closed as theorems.

Lean 4 software archive for the NEMS program: Lean Representational Incompleteness. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Reflective Fold Obstruction

Hull theorem: forward-closed predicates confine the entire reachable hull; fold barriers are real.

Lean 4 software archive for the NEMS program: Lean Reflective Fold Obstruction. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Observer Non-Exhaustibility: A Formal Synthesis and Classification of Observer Architectures

Three blocked families + positive non-collapsing residual architecture from the awareness arc.

Lean 4 software archive for the NEMS program: Lean Observer Non Exhaustability. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

The Architecture of Outer Admissibility

Unified gate theorem; heterogeneous outer certificate forms collapse; strict three-level architecture.

Lean 4 software archive for the NEMS program: Lean Adequacy Architecture. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

The General Science of Reflexive Systems

Anchored completion limits, barrier families, residual aftermath, and the Reflexive Development Law.

Lean 4 software archive for the NEMS program: Lean Reflexive Architecture Nonexhaustibility. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revision policy appear in the repository manifest shipped with the archive.

Cite using the Zenodo DOI after publication. When available, add companion articles or public repository URLs to Zenodo related_identifiers.

Zenodo (PDF + DOI)  ·  GitHub

Survey and Reader's Guide to UGP Physics

Portal paper: scope, structure, and reading paths for the full UGP Physics program.

The Reflexive Reality research programme is a sustained formal investigation into the structural constraints imposed on any perfectly self-contained reality — one with no “outside” from which its laws could be externally selected. The programme encompasses physics, chemistry, biology, evolutionary systems, computational systems, cognitive systems, and AI. It comprises two sister sub-programmes: NEMS (No External Model Selection), which formalizes the “no outside” constraint and machine-checks its theorem-grade consequences in Lean 4; and the UGP Physics Programme, the quantitative physics layer that derives masses, couplings, and quantum numbers from within. The central NEMS results (gauge group forced, three generations selected, Born rule derived, arrow of time fixed, quantum gravity constrained) are archived in 93+ papers at https://www.novaspivack.com/research. The UGP Physics corpus is the quantitative physics sub-programme of Reflexive Reality, sibling to NEMS. Where the NEMS papers establish why the Standard Model structure is the only consistent option, the UGP papers ask what numerical values the masses, couplings, and quantum numbers must take — and derive them from a single uniquely selected integer seed via a deterministic arithmetic cascade. This survey covers the 29 UGP Physics papers (P00–P29), providing: a one-paragraph summary of each paper, a thematic grouping into six natural clusters, an annotated logical dependency graph showing how the UGP results sit within the broader Reflexive Reality programme, reading paths for different research backgrounds, and the five-status epistemic taxonomy (A_ Lean, A_ MDL, A/D, B, D) used throughout the corpus.

Zenodo (PDF + DOI)

Standard Model from the Universal Generative Principle

Derives the Standard Model gauge group and 25 free parameters from the UGP deterministic number-theoretic framework. Bare Higgs prediction: 124.2 GeV at −9.1σ from PDG (open problem, disclosed). Level 1 (self-consistent EW VEV): 124.971 GeV at −2.08σ (Grade C). Structural EW VEV derivation: vₚₛᶜ = 246.16 GeV, −0.024% from vₚᴰᴳ (grade [A−], Lean-certified).

The Standard Model's 25 free parameters — gauge couplings, fermion masses, mixing angles, and the cosmological constant — are experimentally measured inputs with no accepted theoretical origin. We present the Universal Generative Principle (UGP): a deterministic number-theoretic framework in which three axioms — locality, symmetry, and compression (minimum description length) — uniquely select a single integer seed, and a rigid arithmetic cascade from that seed generates the Category-A structural backbone of the Standard Model parameter spectrum — exact bare gauge-coupling rationals, canonical fermion triples, quantum-number assignments, and several parameter-free mass-ratio predictions. Calibrated, scale-anchored, and partially derived sectors are explicitly separated throughout by a five-status claim taxonomy (A_ Lean, A_ MDL, A/D, B, D; ). The framework is complementary to QFT rather than a replacement: it fixes the numerical constants that a QFT Lagrangian takes as input, leaving QFT to supply the scattering dynamics. The Category-A derivation chain is machine-checked in Lean 4 with zero sorry and the standard Mathlib axiom signature; physics-bridge and A/D sectors are explicitly disclosed (companion formalization paper ). How it works. The ridge level n=10 is pinned by three independent arithmetic certificates: ridge minimality (the smallest level admitting a prime-locked mirror-dual survivor pair, Lean: n10\_is\_minimal\_admissible\_ridge); global asymptotic sparsity (for all n, the joint “mirror-dual survivor with b_1=73” constraint forces n=10, Lean: asymptotic\_sparsity\_universal); and a divisor-count certificate (the ratio (R_n)/D_1 = 15/8 unique to n=10 on [5,20], Lean: ckm\_theta23\_ratio\_uniqueness).... Supplementary information (supplementary_information.pdf) is bundled as a second file in this Zenodo record. EPIC_051 update (2026-05-15): Level 1 Higgs mass closure — using the self-consistent EW VEV v = 2M_W/g2(M_W) = 246.27 GeV derived from the same two-loop g2 running that closes OP(viii), the Higgs mass prediction improves from 124.2 GeV (-9.1 sigma) to 124.971 GeV (-2.08 sigma, Grade C). Structural VEV derivation (grade [A-]): v_PSC = 246.16 GeV (-0.024% from v_PDG), via PSC entropy framework, formalized in SrrgLean.VEVProof.* (4 modules, zero sorry, conditional on one named open axiom: psc_ew_entropy_maximization). Round G1 update (2026-05-16): PSCEntropyDuality axioms discharged; one named open axiom remains; grade [A-] unchanged. EPIC_052 update (2026-05-16): neutrino seesaw formalization — NeutrinoMassRatio.lean Phase 2 complete in ugp-lean (all 5 theorems, zero sorry); tight bound |R − 0.02936| < 0.0001 and NuFIT 1% comparison certified; supplementary Table S3 updated.

Zenodo (PDF + DOI)

The GTE Particle Spectrum at n=10

All 24 SM particles rank in the top viability tier across 1,000,035 GTE candidates with 50-fold enrichment (p < 10⁻⁴).

We present a comprehensive analysis of the Generative Triple Evolution (GTE) particle spectrum at n=10, derived from the Universal Generative Principle (UGP). A large-scale discovery run generates 1,000,035 candidate particles below 173 GeV, classified into viability tiers (Green, Blue, Purple, Orange, Red) by a scoring system that reduces in practice to viability-only ranking (GTE compliance = 1.0 for all candidates by construction; stability score is effectively constant). Key findings: (1) all 24 known Standard Model particles rank in the Green tier by both structural landscape position and blind composite score (before force-labeling), with 50-fold SM enrichment (p < 10^-4 vs. random draw; three distinct notions of recovery defined in 5); among the 19 candidates with confidence 0.90, all are SM particles; (2) piecewise-linear hinge laws in the (k, m) plane with universal law-family parameters B = 4.01 10^-6 and D = -3.13 10^-6; (3) genuine oscillatory structure with intrinsic period \!100,000 steps (z>50, stable across five window-size tests; a prior single-cycle estimate of 500,000 steps is corrected here); (4) multivariate surfaces linking ladder index, branch, and c-state to mass and lifetime; (5) 9 genuinely novel candidate states (GTE-P1, P2, P3, P6, P7, P8, P10, P11, and trajectory-reinterpreted P9) representing mass-band predictions (calibration uncertainty $ 1–40 All results are derived from a single deterministic run with frozen code and integrity-checked artifacts (SHA-256 hashes recorded).

Zenodo (PDF + DOI)

GTE Coordinates as Nuclear Descriptors

GTE composition features achieve ~25% improvement over equal-size random baselines on nuclear binding energies; all seven nuclear magic numbers derived analytically.

We show that GTE (Generative Triple Evolution) coordinates derived from nucleon-triple compositions provide competitive predictive power for nuclear binding energies. In a controlled ablation against equal-size baselines—both using exactly 50 features—GTE composition features achieve a 10-fold cross-validated MAE of versus for equal-size random polynomial features (same dimensionality) and for enriched Bethe-Weizsäcker features. The $ \!25 The paper also presents 6-term analytical laws derived from GTE coordinate features, achieving /A MAE for binding energy. For nuclear stability, the parsimonious 6-term logistic law achieves in 5-fold cross-validation (majority-class baseline: 75.0 Additionally, we present an independent analytical derivation of all seven nuclear magic numbers \2, 8, 20, 28, 50, 82, 126 from the GTE cascade. The Nilsson spin-orbit coupling is derived from one-pion-exchange physics, with f_ and m_ predicted by the GTE cascade (P01–P02), giving _ GTE 0.050 at A = 50 after a standard nuclear many-body suppression factor F_ SR 0.42. With a tensor-force correction from the same pion-exchange parameters, all seven known magic numbers appear as large energy gaps in the single-particle spectrum. This constitutes an order-of-magnitude derivation of the shell-closure structure from GTE (bridge claim, ). Furthermore, the ratio _ emp/ _ min(N=50) = 1.149 IPT = 1.1309 (Information Profit Threshold, $1.6 Scope note: The main ML and analytical-law results demonstrate GTE coordinates as a competitive feature space for nuclear structure. The magic-number derivation is an independent analytical result; it uses one nuclear many-body input (F_ SR 0.42) not independently derived from GTE, and the tensor-force correction should be verified with a full shell-model computation. Predictions beyond the training domain (Z>118) are explicitly speculative (Category D).

Zenodo (PDF + DOI)

UGP Dynamics: Attractors, Holography, Thermodynamics

Systematic characterization of UGP as a dynamical system: attractors, holographic properties, and thermodynamic behavior.

The Universal Generative Principle (UGP) is a deterministic, computable framework proposed as a candidate for a theory of everything. While its applications in deriving physical constants have been explored, the fundamental properties of the UGP as a dynamical system have not been systematically characterized. In this paper, we present the results of a comprehensive computational investigation into the UGP's core machinery. Claim types: [T] machine-checked theorem (ugp-lean) | [C] computationally certified (SHA-256) | [B] bridge (theorem + stated premise) | [I] interpretive. We first establish the UGP's computational and structural foundations, proving [T] that its substrate is Turing-universal and [T] compatible with reversible computing. We then analyze its long-term dynamics using a Renormalization Group (RG) operator, revealing [C] that the system is not chaotic but is governed by three observed basin clusters (A, B, C) in a 98-seed deep-trajectory survey. We show [C] that the Logarithmic Complexity Charge Q_4 at seed initialization perfectly predicts basin assignment across the four canonical seeds (one-way ANOVA p < 10^-4), establishing Q_4 as a genuine predictive invariant. Finally, we investigate [C] the emergence of thermodynamics and establish that coarse-grained entropy systematically decreases as trajectories collapse into basin clusters, with [T] a Lean-verified non-monotone witness (gte\_entropy\_prefix8\_gt\_prefix9), while shuffled controls show monotone increase. These findings establish the UGP as a universal, reversible, and dynamically structured substrate.

Zenodo (PDF + DOI)

The Uniqueness of the Universal Generative Principle

Formal proof that the canonical seed (1,73,823) at ridge n=10 is the unique arithmetic-admissible and physically-viable solution, certified to 2.39 ppm.

A candidate theory of everything must not only be sufficient to describe our universe but should ideally be the unique and necessary consequence of its own foundational principles. We present a formal proof of uniqueness for the Universal Generative Principle (UGP) , a deterministic, computable framework for fundamental physics. The proof proceeds as a two-stage sieve that systematically filters the space of possible theories from the mathematically possible to the physically actual. We first define the UGP Universality Class, a set of five axiomatic constraints that any equivalent theory must satisfy. We then demonstrate how Stage 1 of the sieve—based on arithmetic minimality, symmetry, and mathematical elegance—identifies a small set of mathematically admissible universes. Finally, we show how Stage 2 of the sieve—applying a powerful filter derived from the physics of instantiation—proves that only one of these candidates is physically viable. We present the results of a computational sieve that formally verifies this two-stage process, demonstrating that the canonical UGP solution (seeded by n=10, b_1=73) is the unique survivor. This convergence of mathematical and physical constraints provides overwhelming evidence that the UGP is the unique theory within its axiomatic class. We further establish non-circularity: the instantiation filter target _target is derived from CODATA _EM combined with Lean-certified constants (theorems k\_L2\_eq and quarterLockLaw in ugp-lean, zero sorry), independently of b_1=73, and the CODATA-derived value selects b_1=73 to within 2.39 ppm.

Zenodo (PDF + DOI)

Algebraic and Geometric Foundations of the SM Gauge Group

Complete mathematical foundations of UGP: Quarter-Lock Law and algebraic derivation of SU(3)×SU(2)×U(1) from three arithmetic axioms.

We present the complete mathematical foundations of the Universal Generative Principle (UGP) , a deterministic, computable framework from which the laws of physics emerge. We demonstrate that the UGP is a self-contained, axiomatically-driven mathematical structure. We prove the Quarter-Lock Law as a theorem of the UGP's invariant space and derive the algebraic constants of the Elegant Kernel from its symmetries. The centerpiece of this work is a two-stage, first-principles derivation of the Standard Model gauge couplings. First, we derive the bare algebraic values of g_1^2, g_2^2, g_3^2 from their unique, group-specific invariants. Second, we derive a Universal Instantiation Factor, _UGP, a parameter-free correction that universally applies to all bare constants, accounting for the physical realization of the theory on its discrete substrate. This factor is derived from the Principle of Invariant Restoration, a necessary consequence of the Quarter-Lock Law. This work establishes the UGP as a single, coherent mathematical object that derives the algebraic structure and several exact parameter values; other sectors are classified A/D or B in the companion paper . The full SM parameter status ledger, including A/D and B sectors, is given in .

Zenodo (PDF + DOI)

UGP/GTE as an Organizing Principle for Nine Meta-Laws of Physics

UGP/GTE as a unifying vocabulary that subsumes nine universal meta-laws from three axioms: Locality, Symmetry, and Compression/MDL.

We present the Universal Generative Principle (UGP) as a unifying vocabulary that subsumes the premises of nine universal meta-laws (ML-1 through ML-9). The UGP framework, built on three axioms (Locality, Symmetry, Compression/MDL), provides a single substrate—Generative Triple Evolution (GTE, 99 machine-checked modules)—from which each meta-law follows as a structural consequence. For ML-2 (Natural Gradient Flows), ML-4 (Hydrodynamics), ML-5 (Gauge Fields), and ML-6 (Geometric Flows/GR), we show that UGP's axioms subsume the premises of the classical results of Jaynes (1957), Yau (1991), Yang–Mills (1954), and Jacobson (1995) respectively; the proofs of those results stand as cited, and the UGP contribution is showing they are instances of the same framework. For ML-7 (Zipf's Law), we provide a complete, rigorous derivation with a finite-rank Euler–Maclaurin error bound, validated on 21 diverse corpora. For ML-3 (Arrow of Time) and ML-8 (Basin Selection by Conserved Charge), machine-checked backing is available in the NEMS programme (Papers 36, 78, 09, 17, 22). For ML-9 (Attractor Thermodynamics), a Lean-verified entropy witness exists in ugp-lean (gte\_entropy\_prefix8\_gt\_prefix9, zero sorry).

Zenodo (PDF + DOI)

Architecture of a Computable Universe: Five Meta-Laws

Interpretive synthesis: five architectural meta-laws describing a universe that is computable, self-defining, and reflexively closed.

This work presents an interpretive synthesis of the conceptual architecture of the Universal Generative Principle (UGP) as a candidate theory of everything. We synthesize foundational results from the UGP research programme into five interconnected architectural principles that describe a universe that is necessarily computational, mathematical, and self-aware. We show that under the UGP-1/PSC/MDL premise bundle, physical law is not arbitrary but is the minimally selected program at operational level n=10 (The Principle of Constrained Contingency). We argue that physical reality is a conservative extension of a minimal self-referential logical object (The Principle of Ontological Scaffolding). We establish that the universe is a self-executing system (The Principle of Reflexive Computation). For a Category-A backbone of structural constants—including gauge couplings, the Koide phase, and the neutrino splitting ratio—these constants are emergent, computable invariants of the UGP's Elegant Kernel (The Principle of Constants as Compression Ratios); several phenomenological sectors remain open (see companion paper for full status taxonomy). Finally, we argue that observers are a necessary structural feature of the architecture (The Theorem of Necessary Observers). Together, these five principles describe a candidate closed, self-defining architecture in which physics, mathematics, and mind emerge as facets of a single computable reality—conditional on the stated premises and the resolution of the remaining open fronts enumerated in the companion papers .

Zenodo (PDF + DOI)

Reflexive Reality and Self-Defining Physical Law

Formalizes that a complete, self-contained universe has laws arising from within — law, state, and evolution as three aspects of one reflexive process.

Modern physics treats the laws of nature as meta-descriptions written “outside” the universe. If the universe is complete and self-contained, its governing principles must arise from within: the laws, the state, and the act of evolution are three aspects of a single reflexive process. This paper formalises the concept of reflexive reality, classifies known physical theories by their degree of reflexivity, and illustrates with concrete examples how self-defining dynamics manifest. The central philosophical argument is that a finite, knowable, self-contained universe must obey reflexive laws [I]. This argument has been formalised and machine-checked in the companion NEMS programme: the Theorem of Foundational Finality (NEMS 23, NemS.foundational\_finality, Zenodo 10.5281/ zenodo.19429761) [T] and the Reflexive Closure Theorem (NEMS 56, ReflexiveClosure, Zenodo 10.5281/ zenodo.19429835) [T] provide the machine-checked backing. This paper presents the physical intuition and conceptual framework; readers seeking formal proofs are directed to the NEMS companion papers .

Zenodo (PDF + DOI)

Ontological Dissonance Minimization and SDS Validation

Minimizing the ontological dissonance functional D within the SDS framework produces results consistent with maximizing integrated information.

We report that minimizing an ontological dissonance functional D—formulated within the Self-Defining Universe (SDS) framework—produces results empirically consistent with maximizing a spatial-integration proxy for integrated information within the PR-0 field-only substrate. In PR-0 experiments, D-minimization and -proxy-maximization independently discover a short-range binding potential V(d) + /d^2 for the strong interaction. Measured jointly on the same dynamical system (n=21 samples, single deterministic trajectory), D and _proxy exhibit a strong inverse correlation (r=-0.9108, r^2=0.83, p<10^-9 after autocorrelation correction). Under physically motivated constraint-conditioned D, we obtain potential forms qualitatively consistent with (i) short-range binding for strong, (ii) Coulomb-like decay for electromagnetism, (iii) Yukawa-like screening for weak, and (iv) Einstein-like geometric coupling for gravity. These results provide preliminary empirical support for SDS as a generative principle and suggest a connection between dissonance minimization, spatial information integration, and emergent force structure. The constraints embed prior physical knowledge; deriving force constants from D analytically remains an open problem.

Zenodo (PDF + DOI)

Unified Rigidity Theorem for PSC/UGP Universes

Three independently developed rigidity mechanisms jointly select the SM gauge structure and three generations; Lean 4 certified.

We show that three independently developed rigidity mechanisms jointly select the same canonical physical branch under an explicit and audited premise bundle. Layer I/II PSC theory-space selection narrows the space of 4D renormalizable gauge theories to the Standard Model gauge structure and three generations; this is supported by a finite exhaustive enumeration over 34,560 candidate universes across 12 gauge groups including Pati-Salam and E_6 (TE2.2 extended scan: SM ranks #1, only $0.03 all survivors are SM-like, all BSM candidates decisively eliminated ). UGP arithmetic and seed rigidity is fully machine-checked in ugp-lean : the RSUC theorem isolates the Lepton Seed (1,73,823) as the unique MDL-minimal survivor of the two-stage sieve (0 sorrys, 0 custom axioms). Dynamical basin structure places the Lepton Seed and its mirror in the canonical basin A across all tested configurations, while off-residual seeds fall in basins B/C; this is frozen and SHA-256 certified. A new Lean bridge library, unified-rigidity-lean , formalizes the common admissibility framework and proves unified\_rigidity\_theorem under the explicit premise bundle recorded in its assumption ledger. Every claim is strictly typed: theorem-extracted, bridge, computational/certified, or residual/open. The result is a conditional synthesis theorem under an explicit premise bundle; every assumption is typed and audited. The formal PSC step is now unconditional: the Residual Classification (RCC) is established as a theorem (PSC.RCCInfiniteFamilies, zero sorry ); the all-n UGP extension is now proved (asymptotic\_sparsity\_universal, zero sorry ); the neutrino mass-squared splitting ratio m^2_21/ m^2_31 is predicted to $0.4 Any construction of a PSC-admissible theory outside the SM signature, a non-Lepton-Seed UGP survivor satisfying the full sieve, or a canonical-seed trajectory failing the predicted basin would falsify the result.

Zenodo (PDF + DOI)

Formal and Computational Concordance on Perfect Self-Containment

Computational certificate for the Two-Layer PSC Theorem; full constraint independence analysis; three new UGP coupling-ratio predictions.

We present the computational certificate that complements the Two-Layer PSC Theorem , together with a full constraint independence analysis and three new UGP-derived coupling-ratio predictions. Formal backbone (Papers 03 and 05). The PSC theorem chain—RC ^* \GUT exclusion, vector-like exclusion, CP violation required\—establishes as formal theorems that any self-contained 4D renormalizable gauge theory must have (i) G=G_SM and (ii) $N_gen 3$ (Layer I, forced by consistency). Presentation Invariance further selects N_gen=3 as the unique minimal Layer I survivor (Layer II, optimality). Key steps are machine-checked in nems-lean and ugp-lean with zero sorry . Full uniqueness is now unconditional: the Residual Classification (RCC) is a Lean-certified theorem (PSC.RCCInfiniteFamilies, zero sorry). Computational certificate (TE2.2 scan, this paper). An exhaustive enumeration of 20,160 candidate universe descriptions minimises a PSC dissonance functional D[ ]. Only 12 pass the hard PSC Layer I filters ($0.06 The five hard filters (C_1, C_6, C_8, C_12, C_13) contain no reference to G_SM — they encode dimensional consistency, holographic closure, unitary evolution, area law, and K\"ahler structure. The SM-targeted constraints (C_2, C_3) are soft penalties applied only at Layer II; the 12-of-20,160 figure is a result of the non-SM-targeted filters alone. The SM tuple (d,G,N_gen)=(4,G_SM,3) achieves the unique Layer II minimum D_ =1.0667 (Hessian _ =2.0>0). The residual D_ >0 is entirely due to C_4 (Quarter-Lock), a UGP-derived coupling-ratio prediction satisfied by the SM to $95 evaluate to zero at the SM point. New UGP-derived predictions. We add three new constraints derived from UGP orbit invariants (not from SM data): the bare g_1^2/g_2^2 ratio (C_15), the bare g_3^2/g_2^2 ratio (C_16), and a multi-scale Quarter-Lock test (C_4^ ). These are machine-checked rationals in ugp-lean; the SM satisfies all three to within 2–7 Constraint independence....

Zenodo (PDF + DOI)

The Information Profit Principle

Derives the Information Profit Threshold IPT ≈ 1.1309 within the MFRR framework; a reflexive self-maintaining system must generate information structure faster than it dissipates it.

A reflexive self-maintaining system—one that must process information about its own state to remain coherent—must generate information structure faster than it dissipates it. We make this intuition precise within the framework of the Mathematical Foundations of Reflexive Reality (MFRR), deriving a sharp dimensionless threshold—the Information Profit Threshold (IPT)—from two structural inputs of the MFRR framework: the Reflexive Landauer Bound and the Perfect Self-Containment (PSC) requirement. The derivation yields where = (1+)/2 is the golden ratio, giving IPT 1.1309. A system whose generative-to-drain ratio = G/D satisfies > IPT has an energy budget compatible with sustaining coherent self-referential processing; one with $ IPT$ cannot. We present three independent computational validations carried out within the ugp-physics research program: (i) a 2D toy simulator (TE1.H) testing three qualitatively distinct parameter regimes, which confirms coherence growth above and decay below the threshold; (ii) a multi-run evolutionary neural-agent experiment (TE2.1) whose surviving agent populations settle at profit ratios consistent with the supercritical regime; and (iii) a 50-trial parametric sweep (E4) checking that the Reflexive Landauer energy model (the energy-accounting framework underlying the derivation) is internally consistent across randomized configurations, with all modeled PT costs exceeding the bound by strictly positive margins. We carefully distinguish these computational results from experimental evidence. We present eight independent real-world tests across seven domains. (i) Ecology (landmark): Published mean GPP/RECO for tropical moist forest is 1.130, matching IPT to four decimal places (Luyssaert et al. 2007, n=24 sites); all ecosystem types above IPT are thriving, all below 1.0 are declining...

Zenodo (PDF + DOI)

Black Hole Unitarity via Reflexive Unitarity

Black hole information paradox resolved via reflexive unitarity within MFRR; Stinespring fidelity F ≥ 1−10⁻⁸; full Page curve recovered.

The black hole information paradox asks whether gravitational collapse is consistent with global quantum unitarity. We examine this question within the Mathematical Foundations of Reflexive Reality (MFRR) framework , which posits a canonical internal adjudication operator called Transputation (PT) whose inverse PT^-1 implements unitary information recovery at the level of the Perfect Self-Containment (PSC) condition. Within this framework, Hawking evaporation is modelled as a GKSL master equation acting on a JT-like toy Hilbert space. Since every completely positive trace-preserving (CPTP) map admits a Stinespring dilation —a mathematical theorem independent of any gravitational model—the evaporation channel is unitarily equivalent to a reversible evolution on an enlarged system-plus-environment space. The MFRR contribution is interpretive and constructive: we provide a physical mechanism (PT^-1) for understanding which unitary implements the recovery, and we present an explicit construction of the Stinespring unitary for the JT-like PSC model. In the computational experiment TE2.4 , the evaporation channel _ t = e^ t is constructed for a system of n=3 bosonic modes (d=2 Fock levels each, total dimension d_=8) at Hawking temperature T_H 0.004. The environment Hilbert space satisfies _E = 7 (one plus the number of Lindblad operators). Numerical verification on vacuum, Fock, and thermal test states yields Stinespring fidelity $F 1 - 10^-8; the channel satisfies detailed balance to 0.00 and the CPTP property is verified via positive semidefiniteness of all evolved states. A thermalization entropy curve is exhibited (consistent with early-time Page behaviour): entropy rises monotonically from zero toward the thermal value, reaching $97.2 extension to 3+1 quantum gravity, the firewall tension, and a first-principles derivation of PT^-1 remain explicit open fronts.

Zenodo (PDF + DOI)

Braid Atlas v2: Standard Model Topology from First Principles

Derives SM spin, charge, and family quantum numbers from particle braid topology; 64-schema finite vertex audit returns zero mismatches.

The quantum numbers of the Standard Model (spin, charge, family) are experimentally verified but theoretically unexplained. We present a theory that derives these properties from a deeper, information-theoretic foundation: the Universal Generative Principle (UGP). We model fundamental particles as topologically stable, braided worldlines on a discrete substrate. A consistent description ties the UGP arithmetic identifiers (GTE triples) to an effectively complex-valued c component, whose phase carries chirality—the observable signature of a dual-operator evolution \T, T^ for matter versus antimatter, with chirality as a dynamical, path-dependent property. This framework yields a kinematic dictionary—the GTE Rosetta Stone—mapping braid “phenotype” (writhe, strand count, crossing number) to the complex triple “genotype,” fixed by Lorentz, SU(3), and SU(2) symmetry with an explicit pipeline in Appendix B. The Canonical Braid Atlas v2.0 summarizes derived topological fingerprints for all fundamental fermions, extended here to composite hadrons and massive electroweak bosons. Electric charge (Theorem C-W): Q = W_g/N_c for each SM fermion class is machine-checked (BraidAtlas.ChargeTheorem: sm\_charge\_leptons, zero sorry, ugp-lean); anomaly cancellation yields W_g = N_c(N_c-3) iff N_c=3, certifying colour rank (anomaly\_cancellation\_forces\_Nc\_3). Braid winding pattern from N_c: the winding set \N_c-1,-1,0,-N_c for the SM at N_c=3 is derived algebraically (BraidAtlas.ChargeDerivation: sm\_winding\_numbers\_from\_Nc, y\_ql\_unifies\_vv\_and\_winding), closing the kinematic consistency between hypercharge bookkeeping and braid charges. Nine light-baryon (a,b,c;g) triples are Lean-certified (BraidAtlas.CompositeTriples, zero sorry). Companion results on gauge-sector rigidity and RCC closure over all compact simple groups appear in PSC and deeper-theory manuscripts; see the companion formalization paper .

Zenodo (PDF + DOI)

The Koide Relation as a Cyclotomic-12 Closed Form

Koide phase θ = 2/9 derived unconditionally from N_c = 3 via cyclotomic-12 identities; mτ predicted to 61 ppm (0.91σ) — Lean certified.

Koide's 1983 phenomenological identity Q (m_e + m_ + m_ )/( + + )^2 = 2/3 remains one of the most striking numerical coincidences in the charged-lepton mass spectrum, with no accepted structural origin. We present three elementary observations that together promote the Koide relation from a numerical curiosity to a concrete structural statement about the lepton sector. (1) The relation is algebraically equivalent to the geometric condition that the vector v = (, , ) makes a 45^ angle with the democratic axis e = (1,1,1)/; the PDG values place v at 44.99974^ , i.e. 0.95 arcseconds from the exact /4 cone. (2) Solving the relation as a quadratic in with (, ) as inputs yields the closed form which, substituting PDG values for m_e and m_ , predicts m_ = 1.776969 GeV against the PDG value m_ = 1.77686 GeV — a relative error of 61 ppm or 0.91 _ PDG. (3) The surd coefficients of the closed form satisfy the cyclotomic-12 identities (2 + ) = 4 ^2( /12) and (1 + )^2 = 8 ^2( /12), placing the charged-lepton mass spectrum inside the cyclotomic-12 atom family /12, ( /12), \. All identities used are machine-checked in Lean 4 against Mathlib (standard axiom signature, zero sorry). An accompanying dynamical observation constructs an S_3-equivariant Newton-step operator on R^3 that has the Koide null cone as its attractor set, giving an explicit dynamical realisation of the 45^ condition; this result is presented but not required for the main prediction. None of the observations above depend on any particular physics framework, cosmological assumption, or new axiom; they are direct elementary facts about the charged-lepton mass spectrum. (4) The structural origin of the 45^ condition is identified : within the UGP framework, the Koide phase = 2/9 follows unconditionally from the QCD colour rank N_c = 3 via the strand-count identity = (N_c^2 - 1)/(4N_c^2), machine-checked in Lean 4 as koide\_angle\_from\_N\_c\_pure (zero sorry)....

Zenodo (PDF + DOI)

Cyclotomic-12 Structure in the Charged-Fermion Mass Spectrum

Two structural mass relations reduce nine charged-fermion masses to two empirical inputs; VV coefficient α_d = 13/9 derived from SU(5)/SO(10) group theory.

We present two structural mass relations that reduce the nine charged-fermion masses to two empirical scale inputs, and identify the underlying cyclotomic-12 geometric and SU(5)/SO(10) representation-theoretic structure. (1) TT relation: (m_u_g/m_ _g) = ( /6) 2^g + /8 holds against PDG masses at $ 0.37 -free inter-generational identities, with null density 6 10^-6 under 10^6 random-coefficient trials. (2) VV relation: (m_d_g) = 9 (m_u_g) - 6 (m_ _g) - 14 holds at $ 0.17 10^-5 under random triple-permutation of log-mass inputs. Combined with the Koide closed form , all nine charged-fermion masses are determined from two scalar inputs. We identify the cyclotomic-12 geometric origin of the TT coefficient = /6: it is the half-opening angle of the A_2 Weyl chamber (proved in Lean 4 as , zero sorry). The full TT structure is realised by a two-flavon Froggatt-Nielsen UV completion whose flavon VEVs are global minima of a Z_6 Z_16-invariant Cartan-torus potential (Lean-certified), and the generation-doubling factor 2^g is proved via a binary cascade construction (Lean-certified). The three VV coefficient values (13/9,-7/6,-5/14) admit exact SU(5)/SO(10) group-theoretic identities: _d = 1 + rank(SU(5))/N_c^2, _d = -(1 + Y_Q_L), and _d = - (45_SU(5))/ (126_SO(10)), machine-checked in Lean as (zero sorry). These identities are exact group-theoretic facts [T]; however, each value also saturates the pre-registered algebraic basis (triple-target null rate $54.3 and the naive one-loop SM Yukawa RG realization of the EW-scale log-linear VV functional form fails (anomalous closure; see companion paper ). Accordingly the coefficient-value interpretations are classified [C] and the log-linear EW mechanism is algebraically identified ( ; vv\_mechanism\_algebraic, ). The Majorana Higgs dimension factors through the charged-lepton mirror offset as (126_SO(10)) = 2 N_c^2 , exhibiting a cross-sector bridge between the down-quark and neutrino sectors.... Supplementary information (supplementary_information.pdf) is bundled as a second file in this Zenodo record.

Zenodo (PDF + DOI)

MFRR Physics Survey

Survey of MFRR formal and computational results: unified framework in which logic, computation, and physics are aspects of one self-defining process.

We survey the formal and computational results of the Mathematical Foundations of Reflexive Reality (MFRR) programme. The programme establishes a unified framework in which logic, computation, and physics are aspects of one self-defining process: a universe can exist consistently only if its laws are internal, reflexively executed, and energetically self-accounting. The central construct—Transputation —is the unique internal adjudicator of computational degeneracies, machine-proved in a companion Lean 4 development (zero sorry, zero custom axioms). -checked results: forced adjudication ( unique under closed-choice conditions); Born rule uniqueness from MDL; arrow of time from irreversibility; no-emulation ( is super-Turing); SM gauge group and N_gen 3 forced by PSC consistency; UCL2 correction k_gen = ( /10). Lean names and DOIs are in Appendix . certified results (SHA-256 provenance; labels: P=structural prediction compared to experiment, M=model-independent measurement, C=internal consistency check): Standard Model ranks #1 of 34,560 universes scanned, including all major BSM candidates [P: SM selection]; 97.02 Information Profit Threshold 1.1300 0.0001, matching the UGP-derived value k_gen^2/(4 ) to $0.08 emergent force law exponent p = 2.60 0.16 (intermediate regime, asymptotes to r^-2) [M: measured from simulation, not fitted to target]; Reflexive Landauer bound compliance 100 framework: Perfect Self-Containment (PSC) is the logical closure condition for a self-consistent universe; Transputation is its unique internal realization. All results are conditional on stated premises. The Residual Classification is now a Lean-certified theorem (PSC.RCCInfiniteFamilies, zero sorry), making SM uniqueness unconditional. The Information Profit Threshold is machine-checked in Lean (UgpPhysicsLean.IPT.InformationProfitThreshold, zero sorry)....

Zenodo (PDF + DOI)

Neutrino Mass-Squared Ratio from the Braid Atlas

First parameter-free structural prediction of Δm²₂₁/Δm²₃₁ = 0.02936, matching NuFIT 6.0 at 0.16σ with zero free parameters; normal ordering automatic.

No parameter-free structural prediction of the neutrino mass-squared ratio currently exists in the literature. Texture models (Altarelli–Feruglio, Frampton–Glashow–Marfatia, A_4/S_4 flavor symmetries) predict this ratio with a small number of fitted parameters or a symmetry imposed by hand; none derive it from purely structural inputs with zero free parameters. We present such a prediction: m^2_21/ m^2_31 = 0.02936, matching the NuFIT 6.0 global fit (0.02951 0.00098) to 0.16 ($0.52 automatic. The prediction uses only the QCD colour rank N_c = 3 and the Braid Atlas right-handed neutrino b-values \5, 11, 19\. The seesaw exponent is 29/9 = N_c + _Koide, where _Koide = (N_c^2-1)/(4N_c^2) = 2/9 is the Lean-certified Koide phase determined by N_c=3 alone . This exponent admits three independent structural decompositions — in terms of Braid Atlas topology, the mirror-offset invariant , and SO(10)/SU(5) representation dimensions — all converging on 29/9. The integer 29 is the gauge/matter representation defect of the PSC-selected GUT group: (adj_SO(10)) - (spinor_SO(10)) = 45 - 16 = 29 (Lean-certified as seesaw\_index\_is\_gauge\_matter\_defect, zero sorry). The two-flavon Froggatt–Nielsen texture for the right-handed neutrino is (q_1, q_2) = (N_c, strand) = (3, 2), uniquely selected by the MDL criterion (Lean-certified: fn\_structural\_texture\_existence\_and\_uniqueness, zero sorry). The structural Dirac Yukawa scale E_D = v_H/(4N_c^2 - ) = v_H/29 places m_ [55, 75] meV within the Planck bound without a cosmological anchor. A null test confirms the prediction is not a coincidence: only $0.22 reproduce the target ratio within $1 Preregistered falsification tests for JUNO ($ 1 and Hyper-Kamiokande are listed. EPIC_052 update (2026-05-16): Phase 2 Lean certification complete — NeutrinoMassRatio.lean in ugp-lean, all 5 theorems zero-sorry: seesaw exponent 29/9 (fn_texture_gives_seesaw_exponent), M_R cancellation (seesaw_ratio_independent_of_MR), coarse ratio bound 0.029 < R < 0.030 (neutrino_mass_ratio_coarse_bound), tight bound |R − 0.02936| < 0.0001 (neutrino_mass_ratio_tight_bound, certified by norm_num on exact 74-digit integers for b in {5, 11, 19}), and NuFIT 1% comparison (neutrino_mass_ratio_within_1pct_of_nufit); prediction 0.02936 matches NuFIT 6.0 (0.02951) to 0.52 sigma.

Zenodo (PDF + DOI)

UGP Interaction Skeleton Theorem

Lean 4 proof (zero sorry) that UGP winding data alone determines the SM's finite renormalizable interaction skeleton — all vertices, Yukawa couplings, anomaly cancellation.

We prove in Lean 4, with zero for all theorem-grade claims, that the Universal Generative Principle (UGP) winding, chirality, hypercharge, and color-fiber data determine the Standard Model's finite renormalizable interaction skeleton: gauge-fermion vertices, Yukawa mass-generating vertices, anomaly cancellation, representation-level color-singlet constraints, proton-stability forbiddance at dimension four, and a topological dark-sector isolation gap. The central observation is that the same arithmetic/topological invariants that identify particles in the UGP Braid Atlas also constrain their allowed interactions, without any additional gauge-theoretic input. Concretely, the winding number W = N_cQ, the GTE chirality fiber T/T^ , integerized hypercharge Y_3 = 2W - T_6 = 3Y (e.g., Y_3(e_L) = -3, Y_3(Q_L) = +1, Y_3(e_R) = -6, Y_3(u_R) = +4), and the minimal gauge-boson winding spectrum \0, 3 suffice to reproduce all renormalizable SM vertex schemas and exclude all forbidden ones. The main theorem — $UGPVertex(f_1,f_2,B) SMVertex(f_1,f_2,B) for all colored fermions f_1,f_2$ and gauge bosons B — is proved by exhaustive finite case analysis. A finite vertex audit over 64 electroweak schemas returns MISMATCH COUNT\,=\,0 (SHA-256: c927758a9b7801db ). The integer hypercharge is = 2W - , where = 6T_3 is the integerized weak isospin third component. Three independent proofs force N_c = 3; the SM fermion quartet is the unique anomaly-free solution at N_c = 3; proton decay at dimension four is topologically forbidden; and fermions with $W \1,-2,4\$ are isolated from all SM particles via SM bosons. Electroweak predictions from Lean-certified bare couplings give m_W = 80.364\,GeV (-0.42 vs PDG 2024 world average 80.3692 0.0133; -1.28 vs older PDG 80.379 0.012) and _s(M_Z) = 0.1179 (0.0 )....

Zenodo (PDF + DOI)

Substrate Depth and Self-Generated Mass: Closure Structure of UGP

Reflexive closure correlation r = −0.913 (p = 1.3×10⁻¹⁵) between log|c| and self-generated mass fraction across 38 composite hadrons; all triples Lean-derived.

We ask: to what degree does each composite particle generate its own mass internally, versus inheriting it from its constituents? We define the reflexive closure = (M - m_i)/M as the fraction of rest mass arising from internal dynamics (QCD binding energy, gluon fields, quark kinetic energy). Across the PDG composite-particle dataset (n=38), $ _10(M/M_ lightest-in-sector) correlates with RC at Pearson r = -0.83$. The Universal Generative Principle (UGP) assigns every fundamental fermion a canonical integer triple (a,b,c;\,g) via the Generative Triple Evolution mechanism; the c-component encodes position in a Mersenne-prime ladder indexing substrate complexity. The canonical triples for all 38 composite hadrons are now formally Lean-derived (module BraidAtlas.CompositeTriples, zero sorry). We find that _10|c| from the formal GTE Mersenne-sector rule correlates with RC at r = -0.913 (p = 1.3 10^-15, Outcome A); under the Braid-Atlas max-|c| rule, r = -0.981 (p = 2.1 10^-27, Outcome A); and the combined metric _10\! gives r = -0.928 (p = 5.0 10^-17, Outcome A). All five physically motivated rules reach Outcome A (|r| 0.90), while a random-triple null test (10,000 trials) yields 0 of 10,000 reaching that threshold. A 6-dimensional PCA captures 92 with PC1 dominated by _10|c|, _10|b|, and RC moving together. The correlation is structural evidence that the c-component encodes a previously unrecognized physical property: the Mersenne-ladder depth of a particle's canonical triple predicts how much of its rest mass is self-generated versus externally imposed. We discuss implications for the concept of “generation” in the UGP framework and identify a Lean-certifiable version of the correlation for the elementary-fermion subset.

Zenodo (PDF + DOI)

The Arithmetic Uniqueness of the Standard Model

UGP is the unique arithmetic-admissible and physically-viable solution across all ridge levels; Galois substrate Q(ζ₁₂₀) identified; all 8 Zamolodchikov E8 mass ratios Lean certified.

The Universal Generative Principle (UGP) addresses the Standard Model parameter spectrum, classifying each sector by epistemic status , from a uniquely selected integer seed at ridge level n=10 via a deterministic arithmetic cascade. We investigate whether UGP is itself a shadow of a deeper mathematical structure. Four main results. (1) The Asymptotic Sparsity Theorem proves the joint arithmetic-admissibility and physical-viability constraint has exactly one solution across all ridge levels: (n=10,\,b_1=73). The arithmetic component is Lean-certified (unconditional); the physical-viability component uses the CODATA-derived instantiation factor (A/D). (2) The Positive Root Theorem identifies an exact arithmetic correspondence between the SM bare gauge-coupling numerators and the positive-root counts | ^+(G)| of the respective gauge groups; the Chirality Theorem shows the squareness/non-squareness of these numerators is the Lean-certified arithmetic signature of the vector-like/chiral distinction. (3) Galois structure: the UGP algebraic constants lie in the unique minimal cyclotomic field Q( _120) whose conductor is the lcm of the Coxeter numbers of the SM gauge algebras; algebras with h 120 (notably E_7, h=18) are algebraically impossible to contain in Q( _120) — a structural Tower Law theorem, Lean-certified zero-sorry (Corollary ). (4) The WZW route is falsified: the Wess-Zumino-Witten construction cannot reproduce the UGP bare coupling rationals, closing a natural alternative-parent hypothesis. Epistemic status: all main arithmetic theorems are A_ Lean (Lean-certified, zero sorry); physics-bridge interpretations and CODATA-conditioned results are A/D. A front-matter claim-status table lists every result's status explicitly. All computations are reproducible via the open-source scripts at https://github.com/novaspivack/ugp-physics (papers/24\_deeper\_theory/; run\_all.py reproduces all results in <1 s).

Zenodo (PDF + DOI)

Structural Admissibility Selects the Standard Genetic Code

Two-stage sieve uniquely selects the standard genetic code at z = +3.22σ (p < 0.009%); zero of 10⁵ random wobble-admissible codes outperform it.

The near-universality of the standard genetic code raises a deep question: is it the best possible encoding of amino acids, or merely one of many adequate solutions? We address this by applying a two-stage sieve — admissibility followed by multi-criterion viability — to the space of all codon-to-amino-acid maps. Stage 1 (wobble admissibility) reduces the 23 possible maps by a factor of 10^50, to the $23^27 5.8 10^36$ maps that respect the Crick wobble degeneracy rules. Stage 2 applies eight independent biological viability criteria simultaneously: error minimization, prebiotic accessibility, stop-codon robustness, chemical clustering, polar-requirement conservation, evolvability (minimum accessible mutation diversity), historical reachability (first-wave amino acids in ancient codon boxes), and complete stop-codon coverage. Monte Carlo sampling of 10^5 complete wobble-admissible codes shows that the standard code ranks at z = +3.22 on the five-criterion Phase 5 metric ($p < 0.009 is not the mathematical maximum of any single or combined abstract criterion. However, codes that score higher on abstract criteria have max\_jump 5 (hyper-conservative mutation profiles), which disqualifies them under the evolvability criterion (Stage 2G). With all eight criteria applied jointly, no code among 10^5 randomly generated complete wobble-admissible codes outperforms the standard code. The standard genetic code is the unique survivor of the two-stage sieve within this sampling depth. Codes that score higher on abstract criteria all carry hyper-conservative mutation profiles (max\_jump 5), which disqualifies them on biological grounds: they would prevent the drastic substitutions required for protein fold diversification.

Zenodo (PDF + DOI)

A General Theory of Selection

General Selection Principle (GSP): two-stage admissibility + viability sieve with IPT ≈ 1.1309 unifies selection across six domains.

Selection from astronomically large candidate spaces recurs across domains as disparate as subatomic physics, molecular biology, and corporate finance. We propose the General Selection Principle (GSP): the observed configuration is selected by the conjunction of two independently motivated filters—admissibility (structural/arithmetic consistency) and viability (a dynamical threshold on generative-to-dissipative rates). The viability filter requires the rate ratio to exceed the Information Profit Threshold $ = 1 + /2 (2 ) 1.1309$, derived from first principles in . Together, the filters produce asymptotically sparse but non-empty survivor sets. We document two independent quantitative signatures of the GSP. The IPT threshold recurs across five empirical domains — ecology and economics (prior derivation ), nuclear magic numbers, prebiotic chemistry, corporate survival, and microbial metabolism (FBA, r=0.971, p<0.001) — together with one model-internal symbolic-communication result (natural language alphabet size). The algebraic substrate Q recurs in the Standard Model parameter spectrum , the Zamolodchikov E8 integrable QFT mass ratios , ADE Toda field theories, and SU(2)_k WZW quantum dimensions. The E7 Toda theory (h=18, 18 120) provides a clean falsifier: all six mass ratios lie provably outside Q, with the exclusion Lean-certified . Evidence grades range from [T] (theorem-level, machine-certified) through [B] (empirical, replication pending) to [B^-] (empirical, internal dataset); [Br] denotes bridge claims conditional on companion-paper premises; a domain-by-domain evidence map appears in Table . The co-occurrence of these two independent signatures supports the hypothesis that a single mathematical mechanism underlies selection across discrete combinatorial systems; see also the companion SRRG paper for a proposed mechanism.

Zenodo (PDF + DOI)

The Self-Referential Renormalization Group (SRRG)

Unique IR fixed point S* satisfies R[S*]/CΛ[S*] = IPT; minimal symmetry group at S* is U(1); viable-continuation theorem proven — machine-checked in srrg-lean. VEVProof: 4 Lean-certified modules (SrrgLean.VEVProof.*), zero sorry, structural EW VEV derivation vₚₛᶜ = 246.16 GeV (grade [A−], conditional on 2 named open axioms).

We introduce the Self-Referential Renormalization Group : a gradient-flow theory on the space of self-referential physical theories. The flow maximises a net viability functional F[S] = R[S] - C_ [S], where R[S] measures self-representation capacity and C_ [S] decomposes into closure, self-computation, and selector costs inherited from the NEMS/PSC framework. The main body establishes the core fixed-point structure: fixed-point existence via the Master Fixed-Point Theorem, monotonicity of F along the flow (an analogue of Zamolodchikov's c-theorem), linearised contraction rate 1/ where is the golden ratio, and minimal U(1) symmetry under the PSC cost condition. The Information Profit Threshold 1.1309 arises as the efficiency ratio at the fixed point, conditional on the explicit PSC Landauer self-consistency hypothesis h_psc\_sc (grade [A^-]; Remark ). The associated one-dimensional -flow has a candidate projected -function _ = ( - )( -2), with an IR-stable fixed point at = and a UV-unstable separatrix at =2; the algebraic uniqueness and no-third-zero properties are machine-certified in Lean 4 (Vieta's theorem, zero sorry). Conditional physical applications — strong CP phase _QCD=0, three fermion generations N_gen=3, multi-scale SM gauge structure, Higgs quartic recovery _H = m_H^2/(2v^2), and structural exclusion of Planck-scale vacuum energy — are developed in Appendix , with all additional physical bridge hypotheses stated explicitly (Table ). A negative diagnostic for the Weinberg angle via Haar-entropy ratios is included as Appendix .... Round G1 update (2026-05-16): PSCEntropyDuality axioms discharged; one named open axiom remains (psc_ew_entropy_maximization); grade [A-] unchanged.

Zenodo (PDF + DOI)

Computational Universality and the Standard Model: Rule 110, Z₅ Rings, and Mod-7 Structure in UGP

Proves that the UGP canonical cellular automaton (UWCA) bisimulates Rule 110 (Turing-complete) and that this universality is structurally load-bearing in the SM generation structure. CUP-4: the SM generation orbit algebraically determines all 8 bits of Rule 110 (Lean 4, zero sorry). CUP-8/9: the five SM families form a closed Z₅ cyclic ring under Rule 110 (structural p-value ~0.003%, Lean 4). CUP-11: a mod-7 CA realizing the generation orbit can be made computationally universal, yielding a structural dark charge. All core results machine-proved in Lean 4, zero sorry.

The Universal Generative Principle (UGP) is arithmetically universal: its canonical cellular automaton, the UWCA, bisimulates Rule 110 (Wolfram/Cook, Turing-complete). This paper shows that the computational universality of UGP is not incidental but structurally load-bearing in the Standard Model's generation structure. Six results are presented: (1) CUP-4: the SM generation orbit algebraically determines all 8 bits of Rule 110 (Lean 4, zero sorry); (2) CUP-8/9: the five SM families form a closed Z5 cyclic ring under Rule 110, structural p-value ~0.003% (Lean 4); (3) CUP-11: a mod-7 CA realizing the generation orbit exists and can be made computationally universal, yielding a structural dark charge (Lean 4/computational); (4) CUP-12: the MDL-minimal universal Z7 CA has 76-bit description length; (5) the orbit constraints directly require the Rule 110 minterm set enabling glider dynamics; (6) coupling uniqueness: under CUP-4/11 winding assignment, the unique Z7 cross-dimensional coupling is Z7 addition (Lean 4). All core results machine-proved in Lean 4, zero sorry.

Zenodo (PDF + DOI)

The Mirror Branch Braid Atlas: A Parameter-Free Dark Sector from UGP

The prime-lock mechanism that selects the SM lepton seed (1,73,823) simultaneously forces a mirror-branch seed (1,73,2137), predicting a complete dark sector with no free parameters. Electric charge Q=0 for all dark particles is derived from Braid Atlas topology, not assumed. The dark sector gauge group is SU(3)_dark only — no dark SU(2)ₗ. Three generations of free dark leptons at 0.54 MeV, 24.5 MeV, and 3.60 GeV; confined dark quarks near Λ_dark ~ 200 MeV. Most accessible prediction: GTE-P7 at 211.9 MeV (Tier 1 target at Belle II). Core results machine-certified in Lean 4, zero sorry, zero custom axioms.

The Universal Generative Principle (UGP) derives the Standard Model spectrum from a parameter-free arithmetic sieve at ridge n=10. The prime-lock mechanism that selects the SM lepton seed (1,73,823) simultaneously forces a mirror-branch seed (1,73,2137), predicting a complete dark sector with no free parameters. We derive the Mirror Branch Braid Atlas---the dark sector particle classification table. The electric charge Q=0 for all dark particles is derived from Braid Atlas topology, not assumed: the mirror Z_2 involution is an internal GTE arithmetic symmetry, not an SM gauge transformation. The dark sector gauge group is SU(3)_dark only---no dark SU(2)_L exists. Three generations of free dark leptons at 0.54 MeV, 24.5 MeV, and 3.60 GeV coexist with confined dark quarks near Lambda_dark ~ 200 MeV. We establish a new structural connection: c(W) = b_2(RHN) = q_1 in both branches---the first cross-sector structural unification in UGP Physics. The core results are machine-certified in Lean 4 (MirrorWindingNumber.lean, EWBosonRHNConnection.lean, DarkBraidAtlas.lean; zero sorry, zero custom axioms). The dark neutrino mass-squared ratio R_dark = 0.208 is 7x larger than the SM ratio (conditional on the structural gap theorem). The FIMP mechanism overproduces dark matter by 4.84e6 at lambda_s ~ 1e-6; the leading resolution is asymmetric dark matter with eta_chi ~ (2/7) eta_{B+L,pre}, where 2/7 = (Z_7 charge of dark baryon)/(Z_7 group order). The most accessible prediction is GTE-P7 at 211.9 MeV---a Tier 1 target at Belle II. The baryogenesis derivation and dark confinement scale are identified as primary open problems.

Zenodo (PDF + DOI)

A Reader's Guide to the Mathematical Foundations of Reflexive Reality

Executive summary for physicists: Perfect Self-Containment, the MFRR closure theorems, and reading paths into the main monograph.

The Mathematical Foundations of Reflexive Reality (MFRR) framework proves that a physically real universe must be reflexive—its law, its description, and its execution must be three aspects of the same internal mechanism. This condition, Perfect Self-Containment (PSC), eliminates the need for external laws or meta-rules and forces a specific mathematical structure that unifies logic, computation, quantum mechanics, gravitation, and cosmology. MFRR is built on a suite of seventeen closure theorems which prove that any universe that can exist self-consistently and computably must implement: The result is a unified architecture in which quantum phenomena, gravitational curvature, information flow, the Standard Model, and cosmological structure arise as necessary consequences of internal self-consistency. Key results include: Transputation (PT)—a lawful, non-computable adjudication process that resolves Reflexive Landauer Bound—every act of adjudication carries a quantifiable Fisher Information Geometry—the natural geometry of distinguishability, Self-Referential Renormalization Group (SRRG)—a reflexive gradient flow

Zenodo (PDF + DOI)

A Gentle Introduction to the Mathematical Foundations of Reflexive Reality

Popular science introduction: why a self-contained universe must compute itself, and what that forces about physical law.

Why the Universe Computes Itself Most scientific theories assume that the universe behaves according to laws written “outside” the universe: equations that simply exist, like a cosmic instruction manual. But if the universe is all there is, where do these laws come from? Who or what enforces them? The central idea of the Mathematical Foundations of Reflexive Reality (MFRR) is that the universe has no external rulebook. It cannot rely on an outside referee. It must therefore contain its own laws, its own mechanism of execution, and its own system for resolving ambiguities. A universe must, in effect, compute itself. This requirement is called Perfect Self-Containment (PSC). It is not speculative: logical arguments, computational reasoning, and geometric considerations all show that PSC is unavoidable for any universe that exists “on its own.” Transputation: How the Universe Makes Decisions If the universe is fully self-contained, then it must decide what happens next using nothing but its own internal structure. But physical evolution is not always straightforward. Quantum systems, gravitational singularities, and complex informational structures routinely generate degeneracies: multiple possible futures consistent with the same present. MFRR shows that the universe resolves these degeneracies through a physical process called Transputation....

Zenodo (PDF + DOI)

Mathematical Foundations of Reflexive Reality: Summary for Physicists and Referees

Technical summary of the MFRR framework, closure theorems, and Two-Layer PSC Theorem for physicists and peer reviewers.

The Mathematical Foundations of Reflexive Reality (MFRR) establishes a unified framework in which logic, computation, and physics are aspects of one self-defining process. A universe can exist consistently only if its laws are internal, reflexively executed, and energetically self-accounting. The central construct—Transputation (\( \))—realizes lawful internal adjudication of computational degeneracies, producing Perfect Self-Containment (\( \)). The forcing of transputation as the unique internal adjudicator under closed-choice conditions is machine-proved in a companion Lean development (zero sorry; Strong Transputational Universality, STU). Seventeen closure theorems connect logic, energy, geometry, thermodynamics, and theory space. The pinnacle structural result is the Two-Layer PSC Theorem: Layer I (hard PSC axioms) uniquely forces gauge group SU(3) SU(2) U(1) with N_gen 3; Layer II (Presentation Invariance/MDL) selects N_gen=3 as the unique PSC-optimal solution. The framework further resolves the black-hole information paradox via reversible transputation ( ^-1 =I), derives ensemble quantum decoherence as the origin of GKSL dynamics without external environment, and establishes three universal information-energetic laws: (i) superlinear energy amplification ( : 1.01 1.83) quantifying the quantum-to-classical transition; (ii) the Information Profit Principle (Gen/Drain >1.13=1+ /2) governing all self-organization; (iii) decoherence as profit-accounting corruption by additive external noise. Part V realizes MFRR constructively via steel-man experiments (TE_2.1: 11 experiments, 710 runs) deriving gravity, quantization, entanglement, and wormhole formation from information-theoretic constraints alone, and via five advanced theorems (TE_2.2–TE_2.6) proving PSC-optimality of SM, nuclear physics, unitarity, , and -machine necessity....

Zenodo (PDF + DOI)