The Theorem of the Semantic Floor (The Minimal Reflexive Seed) Paper 24 (T7) of the NEMS Suite

{"We":[0,15,73],"formalize":[1],"an":[2,29,69,107],"information-theoretic":[3],"constraint":[4],"on":[5,68],"the":[6,17,20,146],"initial":[7,31,44,86,109],"conditions":[8],"of":[9,19,81,190],"a":[10,23,48,117,126],"Perfectly":[11],"Self-Contained":[12],"(PSC)":[13],"universe.":[14],"prove":[16],"Theorem":[18],"Semantic":[21],"Floor:":[22],"PSC":[24,119,181],"universe":[25,122],"cannot":[26,114],"originate":[27],"from":[28],"underspecified":[30,108,184],"boundary":[32,110],"that":[33,75,106],"requires":[34],"external":[35,70,85,112],"completion":[36,113],"data":[37],"to":[38,53,162],"determine":[39],"record-truth.":[40],"Instead,":[41],"any":[42],"admissible":[43],"state":[45],"must":[46,123],"possess":[47],"\\"Semantic":[49],"Floor\\"—a":[50],"structural":[51],"capacity":[52],"host":[54],"or":[55],"internally":[56],"generate":[57],"Diagonal":[58],"Capability":[59],"(Arithmetic":[60],"Self-Reference)":[61],"and":[62,133,138,151,157,171,183],"Internal":[63],"Adjudication":[64],"(\\\\PT)":[65],"without":[66],"relying":[67],"model":[71],"selector.":[72],"show":[74],"classical":[76,193],"singularities,":[77],"which":[78],"represent":[79],"states":[80],"infinite":[82],"underdetermination":[83],"requiring":[84,111],"conditions,":[87],"are":[88,136],"non-foundational":[89],"under":[90],"PSC.":[91],"The":[92,121,176],"theorem":[93,149],"does":[94],"not":[95,186],"directly":[96],"refute":[97],"GR":[98],"singularity":[99],"models":[100],"as":[101,116,125],"effective":[102,188],"descriptions;":[103],"it":[104],"says":[105],"serve":[115],"foundational":[118,180],"origin.":[120],"begin":[124],"discrete,":[127],"self-interpreting":[128],"\\"Reflexive":[129],"Seed.\\"":[130],"All":[131],"definitions":[132],"conditional":[134],"theorems":[135],"formalized":[137],"machine-checked":[139],"in":[140,192],"Lean":[141],"4.":[142],"This":[143],"overview":[144],"presents":[145],"core":[147],"NEMS":[148],"engine":[150],"selected":[152],"applications;":[153],"stronger":[154],"domain-specific":[155],"derivation":[156],"ontological":[158],"synthesis":[159],"claims":[160],"belong":[161],"separate":[163],"release":[164],"surfaces":[165],"with":[166],"their":[167],"own":[168],"premise":[169],"bundles":[170],"formal":[172],"artifacts.":[173],"Trust":[174],"boundary.":[175],"semantic-floor":[177],"claim":[178],"targets":[179],"origins":[182],"boundaries,":[185],"every":[187],"use":[189],"singularities":[191],"GR.":[194],"Cross-suite":[195],"formalization":[196],"is":[197],"nems-lean":[198],".":[199,201],"See":[200]}

Authors

Publication Details

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

The Theorem of the Semantic Floor (The Minimal Reflexive Seed) Paper 24 (T7) of the NEMS Suite

Nova Spivack
Zenodo (CERN European Organization for Nuclear Research)
Logic, Reasoning, and Knowledge
preprint

The Theorem of the Semantic Floor (The Minimal Reflexive Seed) Paper 24 (T7) of the NEMS Suite

Nova Spivack
preprint en

Abstract

We formalize 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 theorem does not directly refute GR singularity models as effective descriptions; it says that an underspecified initial boundary requiring external completion cannot serve as a foundational PSC origin. The universe must begin as a discrete, self-interpreting "Reflexive Seed." All definitions and conditional theorems are formalized and machine-checked in Lean 4. This overview presents the core NEMS theorem engine and selected applications; stronger domain-specific derivation and ontological synthesis claims belong to separate release surfaces with their own premise bundles and formal artifacts. Trust boundary. The semantic-floor claim targets foundational PSC origins and underspecified boundaries, not every effective use of singularities in classical GR. Cross-suite formalization is nems-lean . See .

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Logic, Reasoning, and Knowledge
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.