Relative PSC and Recursive NEMS (Fractal Closure) Paper 16 (C2) of the NEMS Suite

{"We":[0,112],"introduce":[1],"the":[2,10,66,69,83,104,119,128,151,187],"concept":[3],"of":[4,68,85,107,118],"relative":[5,59],"closure":[6,109],"for":[7,51,202],"subsystems":[8],"within":[9],"No":[11],"External":[12],"Model":[13],"Selection":[14],"(NEMS)":[15],"framework.":[16],"By":[17],"defining":[18],"a":[19,37,44,73,115],"subsystem":[20,45,74,188],"as":[21,193],"an":[22,208],"autonomous":[23],"framework":[24],"F_A":[25],"with":[26,171],"its":[27,52,61,86,94],"own":[28,53,173],"internal":[29,48,87,95],"model,":[30],"records,":[31,54],"and":[32,135,140,156,162,176,183,190],"truth":[33],"relations,":[34],"we":[35,64],"prove":[36,65],"powerful":[38],"recursion":[39],"principle":[40],"(Recursive":[41],"NEMS):":[42],"if":[43,72],"implements":[46],"complete":[47],"semantics":[49],"(BICS)":[50],"it":[55],"necessarily":[56],"satisfies":[57],"NEMS":[58,153,182],"to":[60,78,91,167],"environment.":[62],"Furthermore,":[63],"heredity":[67,205],"diagonal":[70],"barrier:":[71],"is":[75,200],"rich":[76],"enough":[77],"host":[79],"Arithmetic":[80],"Self-Reference":[81],"(ASR),":[82],"undecidability":[84],"record-truth":[88],"applies":[89],"directly":[90],"it,":[92],"rendering":[93],"adjudication":[96],"non-emulable":[97],"by":[98],"any":[99],"total-effective":[100],"algorithm.":[101],"This":[102,148],"establishes":[103],"\\"fractal\\"":[105],"nature":[106],"semantic":[108],"in":[110,145,195],"NEMS.":[111],"also":[113],"present":[114],"strengthened":[116],"version":[117],"No-Emulation":[120],"theorem":[121,154],"(deferred":[122],"from":[123],"Paper":[124],"15),":[125],"explicitly":[126],"formalizing":[127],"instance-level":[129],"encoding":[130,192],"that":[131],"bridges":[132],"physical":[133],"emulation":[134],"computational":[136],"decidability.":[137],"All":[138],"definitions":[139],"theorems":[141],"are":[142],"fully":[143],"machine-checked":[144],"Lean":[146],"4.":[147],"overview":[149],"presents":[150],"core":[152],"engine":[155],"selected":[157],"applications;":[158],"stronger":[159,184],"domain-specific":[160],"derivation":[161],"ontological":[163],"synthesis":[164],"claims":[165],"belong":[166],"separate":[168],"release":[169],"surfaces":[170],"their":[172],"premise":[174],"bundles":[175],"formal":[177],"artifacts.":[178],"Trust":[179],"boundary.":[180],"Recursive":[181],"no-emulation":[185],"use":[186],"formalism":[189],"instance":[191],"defined":[194],"nems-lean":[196],";":[197],"\\"fractal":[198],"closure\\"":[199],"shorthand":[201],"those":[203],"proved":[204],"lemmas,":[206],"not":[207],"additional":[209],"metaphysical":[210],"posit.":[211],"See":[212],".":[213]}

Authors

Publication Details

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

Relative PSC and Recursive NEMS (Fractal Closure) Paper 16 (C2) of the NEMS Suite

Nova Spivack
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

Relative PSC and Recursive NEMS (Fractal Closure) Paper 16 (C2) of the NEMS Suite

Nova Spivack
preprint en

Abstract

We introduce the concept of relative closure for subsystems within the No External Model Selection (NEMS) framework. By defining a subsystem as an autonomous framework F_A 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. 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. Recursive NEMS and stronger no-emulation use the subsystem formalism and instance encoding as defined in nems-lean ; "fractal closure" is shorthand for those proved heredity lemmas, not an additional metaphysical posit. See .

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