The Theorem of Semantic Terminality Paper 18 (T1) of the NEMS Suite

Traditional physics often assumes an infinite reductionist regress: an endless hierarchy of deeper micro-theories. In this paper, we prove that in any universe satisfying Perfect Self-Containment (PSC), this hierarchy must terminate. We introduce the notion of a PSC-optimal theory—one that minimizes descriptional complexity while fully capturing all macroscopic record facts. We then establish the Theorem of Semantic Terminality: any "deeper" theory extending a PSC-optimal description either fails PSC (by requiring new external selectors) or is physically redundant (by 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 represents the logical limit of semantic closure. All definitions and theorems are formalized and machine-checked in Lean 4. Trust boundary. Terminality is relative to the formalized complexity/optimality predicates and PSC definition in nems-lean ; SM mentions are illustrative. See .

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22733159
Primary Topic
Quantum Mechanics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The Theorem of Semantic Terminality Paper 18 (T1) of the NEMS Suite

Nova Spivack
Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
preprint

The Theorem of Semantic Terminality Paper 18 (T1) of the NEMS Suite

Nova Spivack
preprint en

Abstract

Traditional physics often assumes an infinite reductionist regress: an endless hierarchy of deeper micro-theories. In this paper, we prove that in any universe satisfying Perfect Self-Containment (PSC), this hierarchy must terminate. We introduce the notion of a PSC-optimal theory—one that minimizes descriptional complexity while fully capturing all macroscopic record facts. We then establish the Theorem of Semantic Terminality: any "deeper" theory extending a PSC-optimal description either fails PSC (by requiring new external selectors) or is physically redundant (by 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 represents the logical limit of semantic closure. All definitions and theorems are formalized and machine-checked in Lean 4. Trust boundary. Terminality is relative to the formalized complexity/optimality predicates and PSC definition in nems-lean ; SM mentions are illustrative. See .

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Quantum Mechanics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.