Table of Contents
The Reflexive Reality research program is a sustained formal investigation into the deepest structural constraints on any consistent, self-contained reality. Its central insight is simple but far-reaching: if a universe has no “outside,” then its laws, its observers, and its ontological ground must all arise from within — and this self-containment turns out to impose precise, theorem-grade constraints on everything from the structure of physical law to the nature of consciousness.
The program’s primary technical spine is NEMS — No External Model Selection — a suite of 93 machine-checked papers (plus companions and Lean formalizations) that develops these constraints systematically, from foundational logic through gauge theory, quantum mechanics, consciousness, and ontology. Surrounding NEMS is a growing family of extended mathematical programs: Infinity Compression, Reflexive Architecture, Representational Incompleteness, Reflective Fold Obstruction, Observer Non-Exhaustibility, Adequacy Architecture, and Reflexive Architecture Nonexhaustibility — each proving deep structural impossibility and residual results for self-referential and reflexive systems.
Separately, Novelty Theory explores a different kind of structural constraint: the impossibility of final explanatory closure even under fixed deterministic laws — a machine-checked result about why genuine novelty is not just possible but necessary. All results are machine-checked in Lean 4 with a zero-sorry, zero-axiom policy wherever achievable.
All published papers are archived on Zenodo with permanent DOIs and are linked below. The program is under active development; new papers and results are added regularly.
Is This AI-Generated?
In the era of AI-assisted science it is natural to ask how much AI was involved in this research program, and how it was used. Transparency matters, so here is an honest account.
These proofs were not generated autonomously by AI. The genesis of this project originated in the 1990s, before the advent of modern AI and proof assistants such as Lean. The ideas here are original, human-generated, and human-directed, developed over many decades before AI tools existed.
Where AI was not used: AI did not originate the theoretical ideas, direct the theoretical development, or make the underlying breakthroughs.
Where AI was used: AI was used for adversarially testing ideas, helping with Lean formalization and debugging, assisting in project management, and for documentation and drafting. AI assistance made a project of this scale tractable — the author made earlier attempts at developing and formalizing versions of this theory using Prolog, Scheme, and other languages, but the task was too large and the tools were not designed for it.
Computational tools: Some results made use of scientific computing tools for numerics, simulations, and computational search — including SageMath, PARI/GP, various SAT solvers, Python, NumPy, and SciPy.
A. Where to Start
If you are new to this research, the following papers are designed as entry points for different audiences. Each is self-contained and written to orient a reader to the full program from that angle.
B1. NEMS — The Core Suite (Papers 00–92)
Featured papers
Paper 00 — Overview of the NEMS FrameworkAll
The suite overview: structure, dependency map, reader paths for all audiences.
Paper 07 — The NEMS Framework for PhysicistsPhysicists
Self-contained introduction to NEMS for physics audiences; covers gauge structure and quantum gravity angle.
Paper 81 — Big Results from the NEMS ProgramAll — synthesis
Flagship theorems across nine thematic arcs: logic, physics, quantum mechanics, computation, epistemology, ontology, and reflective certification. Updated April 2026.
Paper 86 — Reflexive Reality: A Philosophical ExpositionAll
What the NEMS research program tells us about the deepest questions.
Paper 87 — Reflexive Reality: A Survey for Formal Theory SpecialistsFormal Theory
New impossibility results, new proof methods, and a positive science of what happens after impossibility.
Paper 89 — Reflexive Reality: A Survey for AI, Agents, and AGI ResearchersAI / AGI
Theorem-grade constraints on intelligence, agency, safety, and machine consciousness.
Paper 90 — A Continent Map of the Reflexive Reality ProgramAll — map
Structure, dependencies, reader routes, and the role of recent results.
Paper 91 — Closure Without ExhaustionAll — flagship
A theorem of internal semantic non-exhaustion for reflexive systems.
Paper 92 — Consciousness, Phenomenology, and MindAll
A formal theory of sentience, qualia, and awareness in Reflexive Reality.
Complete listing — all 93 papers
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.
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.
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.
Paper 04 — Instantiating No External Model Selection in Physics
Applies NEMS to macroscopic physical records and establishes the Class IIb criterion.
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.
Paper 06 — No External Model Selection in Quantum Gravity
Extends NEMS to quantum gravity via records, diffeomorphism redundancy, and non-effective internal selection.
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.
Paper 09 — Physical Records Imply Non-Effective Internal Adjudication
Proves that diagonal-capable physical records force non-effective internal adjudication in PSC universes.
Paper 10 — Transputation Versus Computation
Distinguishes Transputation (non-algorithmic internal adjudication) from computation and proves its necessity.
Paper 11 — Physical Incompleteness from Universal Computation
Machine-checked diagonal barrier: closed physical theories with universal computation are physically incomplete.
Paper 12 — Determinism No-Go Under Perfect Self-Containment
Diagonal-capable records forbid total-effective record determinism in theories with genuine record-divergent choice.
Paper 13 — Born Rule as a Closure Fixed Point
Proves the Born rule is the unique quantum probability assignment in perfectly self-contained theories.
Paper 14 — Born Internal & Complete Semantics Implies Perfect Self-Containment
The reverse direction: from quantum probability (Born rule) back to closure.
Paper 15 — No-Emulation and Self-Necessitating Adjudication (C1)
Proves no-emulation as a constraint and that self-necessitating adjudication follows from closure.
Paper 16 — Relative PSC and Recursive NEMS (Fractal Closure) (C2)
Fractal closure: relative PSC and recursive application of NEMS constraints.
Paper 17 — Necessary Adjudicators and Reflexive Self-Model Closure (RSMC) (C3)
Proves necessary adjudicators and the reflexive self-model closure requirement.
Paper 18 — The Theorem of Semantic Terminality (T1)
Semantic terminality: the closure of semantic self-description under NEMS constraints.
Paper 19 — The Non-Emulability of Execution — Agentic Necessity (T2)
Execution cannot be emulated from within; agentic necessity follows.
Paper 20 — Rigidity of the Gauge Signature under PSC: A Sieve Theorem (T3)
Sieve theorem for theory spaces; residual classification program for gauge signatures.
Paper 21 — The Theorem of Existential Rigidity: The Collapse of Contingency (T4)
Contingency collapses under PSC: existence is not contingent but necessary.
Paper 22 — Irreducible Agency: Non-Algorithmic Adjudication as a Physical Requirement (T5)
Agency is irreducible: non-algorithmic adjudication is a structural physical requirement.
Paper 23 — Foundational Finality: The Master Loop and the End of Reductionism (T6)
The master loop theorem; reductionism ends at the reflexive fixed point.
Paper 24 — The Theorem of the Semantic Floor: The Minimal Reflexive Seed (T7)
Minimal reflexive seed theorem: the semantic floor forced by PSC.
Paper 25 — The Unified Rigidity Theorem: The Lepton Seed (T8)
Unifies the rigidity results; the lepton seed is the unique PSC-minimal survivor.
Paper 26 — A General Self-Reference Calculus
One fixed-point theorem and one diagonal barrier behind Gödel, Kleene, Löb, and NEMS.
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.
Paper 28 — Reflection as a Resource
Stratified representability, fixed points under restricted internalization, and a selector-strength hierarchy.
Paper 29 — Selector Strength and Completion Hierarchies
A poset of internal determinacy, barriers, and escape costs.
Paper 30 — Second Incompleteness for Self-Certifying Learners
No total internal certifier exists under diagonal capability — a learning-theoretic incompleteness.
Paper 31 — Epistemic Agency Under Diagonal Constraints
Society as a verification protocol; strict separations and the necessity of role diversity.
Paper 32 — Self-Improvement Under Diagonal Constraints
No universal self-upgrade certifier; stratified improvement and evolution as an attractor architecture.
Paper 33 — Self-Awareness as a Resource
Hierarchies of internal self-knowledge, selector necessity, and limits of introspective optimality.
Paper 34 — A Sieve Engine for Theory Spaces
Proof-carrying classification and residual certification for theory spaces.
Paper 35 — Oracles as External Selectors
NEMS constraints on hypercomputation and physical computability.
Paper 36 — The Arrow of Time from Closure
Stable records, no-overwrite, and the necessity of irreversibility in PSC universes.
Paper 37 — Chronology Under Closure
NEMS constraints on admissible time travel.
Paper 38 — NEMS Constraints on Black Hole Information
Applies PSC and diagonal-capability constraints to the black hole information problem.
Paper 39 — Probability as Closure in General Probabilistic Theories
Uniqueness and rigidity of state assignment from auditability principles.
Paper 40 — Institutions Under Diagonal Constraints
Minimal role sets, robust audit protocols, and the impossibility of universal self-governance.
Paper 41 — Refinement Flow of World-Types
Time as growth of stable distinguishability.
Paper 42 — Record Entropy and Noncomputability
Monotone semantic complexity under diagonal capability.
Paper 43 — Adjudication as Decoding: Semantic Error-Correction under PSC Closure
The universe as a semantic error-correcting code; adjudication as decoding.
Paper 44 — Calibration as Closure
Laws as compression fixed points under no-free-bits; the calibration principle.
Paper 45 — Local Dynamics, Global Semantics: A Closure Engine for Semantic Nonlocality
A closure engine for semantic nonlocality from local dynamics.
Paper 46 — Causal Nonlocality from Closure
A no-go for naive semantic locality under PSC and diagonal capability.
Paper 47 — No Spooky-to-Signal Compiler
EPR correlations cannot be total-effectively upgraded to FTL signaling.
Paper 48 — Holography Under Closure
World-type duality, no-free-bits reconstruction, and limits of boundary decoding.
Paper 49 — Cosmic Audit: Universe as a Self-Auditing Institution
Distributed adjudication networks forced by record closure.
Paper 50 — A Complete Logic of Certification
Soundness, completeness, and maximality for stratified verification protocols.
Paper 51 — Necessary Incompleteness of Internal Semantic Self-Description
The non-self-erasure theorem and semantic remainder in reflexive systems.
Paper 52 — Direct Self-Semantic Fixed Points
Intrinsic diagonal claims against final internal self-theories.
Paper 53 — Syntax Cannot Exhaust Semantics
A no-reduction theorem for reflexive systems.
Paper 54 — Observers, Minds, and Reflexive Non-Self-Exhaustion
An observer corollary of the no-final-self-theory theorem.
Paper 55 — Qualia and the Semantic Ledger
A formal dissolution of the hard problem of consciousness.
Paper 56 — The Reflexive Closure Theorem
Closure without collapse in reflexive systems.
Paper 57 — The Reflexive Unfolding Theorem
Frontier generation and why there is change.
Paper 58 — Necessary Reflexive Intelligence
Why nontrivial reflexive worlds are not random or robotic.
Paper 59 — A Calculus of Intelligence
Frontier, adjudication, and self-modeling in reflexive systems.
Paper 60 — Reality as Recursive Intelligence
The final theorem of reflexive closure, frontier, and adjudication.
Paper 61 — Ghost Collapse and Ledger Finality
Why off-ledger being is either illicit or null.
Paper 62 — No Self-Actualizing Ledger
Syntax, semantics, and same-level completion cannot ground reality.
Paper 63 — The Alpha Theorem
The necessary ontological ground beyond syntax and semantics.
Paper 64 — Primordial Ground and Grounded Existence
Whatever exists is Alpha-grounded; Alpha is the unique pre-categorial ontological ground.
Paper 65 — Qualia as Alpha-Grounded Semantic Content
Known qualia are irreducible semantic content whose actuality is Alpha-grounded.
Paper 66 — Phenomenal Presence and Ground-Manifestation
From Alpha-grounded qualia to the manifestation theorem.
Paper 67 — Awareness as the Locus of Ground-Presence
Why conscious presence is not an object in the world.
Paper 68 — Alpha Is Not Null
Ground, presence, and the refutation of nihilistic emptiness.
Paper 69 — Reality, Existence, and Awareness
The unified theorem of ground, articulation, and manifestation.
Paper 70 — The Golden Bridge
The final unification of ground, being, and awareness.
Paper 71 — Viable Continuation Under Constraint
A general theory of stability, pathology, and collapse across reflexive systems.
Paper 72 — Structural Principles of Stability, Pathology, and Collapse
Canonical principles of viable continuation across reflexive systems.
Paper 73 — The Constraint Theory of Autonomous Agency
Self-indexing manifolds and the boundaries of unified systems.
Paper 74 — The Formal Structure of Phenomenology
Qualia, manifestation, and selector-access regimes.
Paper 75 — The Uniqueness of the Phenomenology Framework
Uniqueness, categoricity, and survivor selection for closure-compatible phenomenology.
Paper 76 — A Formal Theory of Transputation
Closure, internal adjudication, and non-algorithmic continuation selection.
Paper 77 — DSAC as a Realization of Transputation
A candidate architecture for internal adjudication under closure.
Paper 78 — Second-Law Grounding from Closure
Record refinement, hidden history, and the structural preconditions of thermodynamic irreversibility.
Paper 79 — Foundational Admissibility
Closure as a selection principle on cosmological possibility space.
Paper 80 — The Classification Cascade for Foundational Universes
Survivor selection from closure to physics architecture.
Paper 82 — Meta-Principles of Closure, Admissibility, and Internal Burden
Determinacy without outsourcing: the meta-principles governing the NEMS program.
Paper 83 — The Internality / Outsourcing Schema
A general Lean theory of load-bearing tasks.
Paper 84 — The Survivor Calculus
A generic admissibility cascade for theory spaces.
Paper 85 — Admissible Continuation
Closure-compatible burden-bearing constraints on system evolution.
Paper 88 — Reflexive Reality: A Survey for Physicists
What closure proves about the Standard Model, quantum mechanics, and spacetime.
Companion notes
Reader On-Ramp: The PSC–Born Fixed-Point Architecture
What is proven, what is assumed, and where disagreement must land.
Significance of the General Self-Reference Calculus
Explanatory note for Paper 26 of the NEMS Suite.
Explanatory Companion Note to Paper 30
Why perfect self-certification is impossible in self-referential systems.
Domain Corollaries of Viable Continuation
Companion to Paper 71: Section 12 and principal appendices.
B2. UGP Formalization
The Universal Generative Principle (UGP) is a mathematical framework developed as part of the foundational research program. The lean-ugp library is a complete, machine-checked Lean 4 formalization of UGP’s core mathematical results: the ridge sieve, prime-lock criterion, Generative Triple Evolution update map, canonical orbit, Quarter-Lock identity, Turing universality, and self-reference (Lawvere, Kleene, Rice) — with a strict zero-sorry, zero-custom-axiom policy. Further theoretical development of UGP is ongoing; the Lean formalization is the published artifact for this stage of the work.
ugp-lean: A Machine-Checked Formalization of the Universal Generative Principle
Complete Lean 4 formalization: ridge sieve, canonical seed (1,73,823), GTE orbit, Quarter-Lock, Turing universality (Rule 110), self-reference (Lawvere, Kleene, Rice). 51 modules. Zero sorry, zero custom axioms.
Lean source archive: Zenodo (PDF + DOI) (tarball of full source)
↑ Back to topB3. PSC / Standard Model Physics Papers
The following NEMS papers are particularly relevant to physics — specifically to the derivation of the structure of gauge theory and quantum mechanics from the principle of Perfect Self-Containment (PSC). They form the physics-facing spine of the NEMS suite and can be read independently by physicists.
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.
Paper 04 — Instantiating No External Model Selection in Physics
Applies NEMS to macroscopic physical records and establishes the Class IIb criterion.
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.
Paper 06 — No External Model Selection in Quantum Gravity
Extends NEMS to quantum gravity via records, diffeomorphism redundancy, and non-effective internal selection.
Paper 07 — The NEMS Framework for Physicists
Self-contained introduction to NEMS for physics audiences; covers gauge structure and quantum gravity angle.
B4. Lean Formalizations (Software Archives)
Each of the following Lean 4 software archives is a machine-checked formalization accompanying the corresponding NEMS paper or program. All maintain a zero-sorry policy on their proof targets (see each repository’s MANIFEST.md for the audit). Archives are citable via Zenodo DOI and browsable on GitHub.
| Archive | Zenodo DOI | GitHub | Description |
|---|---|---|---|
| NEMS core self-reference library Papers 01–51 formalized | 10.5281/zenodo.19429227 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Nems**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and rev… |
| Reflexive closure, frontier, and awareness arc Papers 52–70 formalized | 10.5281/zenodo.19429233 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Reflexive Closure**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file … |
| Viable continuation program Papers 71–72 formalized | 10.5281/zenodo.19429260 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Viable Continuation**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact fil… |
| Sentience and autonomous agency Paper 73 formalized | 10.5281/zenodo.19429245 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Sentience**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope an… |
| Phenomenology framework Papers 74–75 formalized | 10.5281/zenodo.19429243 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Phenomenology**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scop… |
| Transputation and DSAC Papers 76–77 formalized | 10.5281/zenodo.19429229 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Transputation**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scop… |
| Composition, recursion, and uniformization in APS APS foundation | 10.5281/zenodo.19429235 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Aps Recursion Uniformization**. This Zenodo record bundles a pinned Git snapshot of the formalization. … |
| Representational Incompleteness §B5c program | 10.5281/zenodo.19430706 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Representational Incompleteness**. This Zenodo record bundles a pinned Git snapshot of the formalizatio… |
| Infinity Compression §B5a program (7 papers) | 10.5281/zenodo.19429241 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Infinity Compression**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact fi… |
| Reflexive Architecture (Strata) §B5b program (Summits 1 & 2) | 10.5281/zenodo.19430707 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Reflexive Architecture**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact … |
| Reflexive Architecture Nonexhaustibility §B5g program | 10.5281/zenodo.19429252 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Reflexive Architecture Nonexhaustibility**. This Zenodo record bundles a pinned Git snapshot of the for… |
| Observer Non-Exhaustibility §B5e program | 10.5281/zenodo.19429254 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Observer Non Exhaustability**. This Zenodo record bundles a pinned Git snapshot of the formalization. E… |
| Reflective Fold Obstruction §B5d program | 10.5281/zenodo.19429256 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Reflective Fold Obstruction**. This Zenodo record bundles a pinned Git snapshot of the formalization. E… |
| Adequacy Architecture §B5f program | 10.5281/zenodo.19430708 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Adequacy Architecture**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact f… |
| UGP Lean Formalization UGP core (§E) | 10.5281/zenodo.19429247 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Ugp**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file scope and revi… |
| Reflexive Reality (early Lean scaffold) Foundational scaffold | 10.5281/zenodo.19429231 | GitHub | Lean 4 software archive for the **NEMS** program: **Lean Reflexive Reality**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file … |
| Novelty Theory §C program | 10.5281/zenodo.19423148 | GitHub | Lean 4 software archive for the **NEMS** program: **Novelty Theory Lean**. This Zenodo record bundles a pinned Git snapshot of the formalization. Exact file sco… |
B5. Extended Mathematical Programs
Beyond the core NEMS suite, the Reflexive Reality program includes a family of extended mathematical programs. Each proves deep structural results about self-referential and reflexive systems — impossibility theorems, residual structure theorems, and classification results — using machine-checked Lean 4 proofs.
B5a. Infinity Compression
Infinity Compression proves that canonical certification does not exhaust reflective structure: when a formal system has a bare certification layer and a richer realization layer, the two cannot be collapsed, and the difference is organized by fibers, sections, and obstruction laws. The program consists of seven papers covering the core theorem, external validation across twelve mathematical families, algebraic and arithmetic discharge, topological discharge (Quillen’s Theorem A), and a synthesis summit.
Canonical Certification Does Not Exhaust Reflective Structure
Flagship IC paper: canonical bare certification vs enriched realization; fibers; NEMS spine.
Reflective Non-Exhaustion: Certification, Realization, Fibers, and Obstruction
Summit: distilled reflective non-exhaustion thesis, scope, and Gödel distinction.
Certification, Realization, and Obstruction: A Universal Fiber Architecture
Synthesis map of the full program; routes C/A/B/D; cross-domain dictionary.
External Validation of a Positive-Closure Proof Architecture
Transferability across twelve external mathematical families (T1–T12).
Fiber Architecture for Group Extensions in Lean 4
Cocycles, splitting criterion, and the cohomological bridge.
Homotopy Data for Quillen's Theorem A: Galois Connections in Lean 4
Machine-checked nerve maps and 1-simplex witnesses (closure/kernel edges) for Quillen's Theorem A in the Galois connection case. Simplicial homotopy step deferred to future Mathlib work.
Completing the Cohomological Extension Package
Mathlib companion: section cocycles and splitting criterion for PR reviewers.
Lean archive: Zenodo — lean-infinity-compression · GitHub
Reflexive Architecture (Strata — Summits 1 & 2)
Reflexive Architecture (Strata) is a machine-checked synthesis of NEMS, APS (Abstract Indexed Programming Systems), and Infinity Compression into a unified layered architecture, with two summits: one on closure, realization, and reflective residue; one on the geometry of what maps forget (the structure of non-injective comparison and its residual).
Closure, Realization, and Reflective Residue (Summit 1)
Strata synthesis: NEMS + APS + IC with bridge theorems and the Non-Erasure Principle.
The Geometry of What Maps Forget (Summit 2)
Residual kernels and what maps forget: universal fiber architecture for non-injective comparison.
Lean archive: Zenodo — lean-reflexive-architecture · GitHub
Representational Incompleteness
Representational Incompleteness proves that no parametric self-model can cover its own diagonal, with a parallel topological strand organizing a boundary invariant as a homeomorphism obstruction. Six adversarial “no-escape” routes (regress, collapse, cross-object readout, partial models, decidable self-reference, model substitution) are closed as theorems.
Representational Incompleteness
No parametric self-model covers its own diagonal; six no-escape routes closed as theorems.
Lean archive: Zenodo — lean-representational-incompleteness · GitHub
Reflective Fold Obstruction
Reflective Fold Obstruction proves that if a predicate is preserved along primitive steps of an internal relation, then the internal reflexive-transitive closure cannot reach any state falsifying that predicate — establishing a precise notion of “fold” (an architecture-changing transition the internal calculus cannot generate). Instantiated on a reflective slot calculus and extended to semantic type obstructions.
Reflective Fold Obstruction
Hull theorem: forward-closed predicates confine the entire reachable hull; fold barriers are real.
Lean archive: Zenodo — lean-reflective-fold-obstruction · GitHub
Observer Non-Exhaustibility
Observer Non-Exhaustibility classifies internal reductive strategies for “exhausting” observer architectures into three provably blocked families — parametric self-model exhaustion, internal closure and reflective iteration, and total internal certification — and establishes a positive non-collapsing residual architecture from the awareness arc of the reflexive-closure program.
Observer Non-Exhaustibility: A Formal Synthesis and Classification of Observer Architectures
Three blocked families + positive non-collapsing residual architecture from the awareness arc.
Lean archive: Zenodo — lean-observer-non-exhaustability · GitHub
Adequacy Architecture
Adequacy Architecture proves that heterogeneous outer certificate forms (compressed witnesses, abstraction layers, quotient representations, transport claims, upgrade witnesses) collapse to one unified gate in a disciplined certificate world, with a richer second layer canonically forced above it and a partially reconstructible residual band above that.
The Architecture of Outer Admissibility
Unified gate theorem; heterogeneous outer certificate forms collapse; strict three-level architecture.
Lean archive: Zenodo — lean-adequacy-architecture · GitHub
Reflexive Architecture Nonexhaustibility
Reflexive Architecture Nonexhaustibility frames reflexive systems as a unified scientific subject and proves the general laws: anchored internal completion under strong demands is lawfully blocked (not as formless collapse but via classifiable barrier families), with a structured residual aftermath, two semantic summits (computational vs proof-theoretic strength), and a dynamical layer — the Reflexive Development Law.
The General Science of Reflexive Systems
Anchored completion limits, barrier families, residual aftermath, and the Reflexive Development Law.
Lean archive: Zenodo — lean-reflexive-architecture-nonexhaustibility · GitHub
↑ Back to topB6. Datasets
The following dataset is published as part of the NEMS program.
NEMS PSC Computational Validation Dataset
Computational validation dataset for the PSC derivation results.