Viable Continuation Under Constraint A General Theory of Stability, Pathology, and Collapse Across Reflexive Systems

We introduce a general theorem framework for systems whose persistence depends on reconciling local transitions with whole-system viability. The framework is intentionally abstract: it applies to record-bearing, recursively constrained systems equipped with transitions, viability conditions, traces, channels, anchors or proxies, and a local-to-global compatibility relation. We then develop a theorem spine in three levels. First, a family of foothill theorems shows that local structural defects induce failure of corresponding system-level robustness properties. Second, a family of ridge theorems composes these failures into broader structural impossibility results concerning proxy guidance, local admissibility, correction through multiplicity, and viability support through sufficient capacity. Third, a summit abstraction, BoundaryDefect, unifies the main defect families and yields a general viability-boundary theorem: whenever a system exhibits any one of the identified boundary defects, it fails a corresponding schema of robust viable continuation. The abstract theorem family is fully proved in Lean; the domain sections that follow are interpretation schemas and corollary schemas, not full domain formalizations. The framework is machine-checked and is designed to support disciplined instantiation across diverse domains, including self-modifying AI systems, legal and institutional orders, organismal and ecological systems, markets, civilization-scale coordination systems, and other recursively constrained structures. Trust boundary. Machine-checked claims are those in \nolinkurlviable-continuation-lean matching . Domain vignettes and bridge narratives are schemas, not additional closed theorems unless a bridge module proves a toy witness. Summit anchors: \nolinkurlnecessary_conditions_for_robust_viable_continuation; \nolinkurlgeneral_viability_boundary.

Authors

Publication Details

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

Viable Continuation Under Constraint A General Theory of Stability, Pathology, and Collapse Across Reflexive Systems

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

Viable Continuation Under Constraint A General Theory of Stability, Pathology, and Collapse Across Reflexive Systems

Nova Spivack
preprint en

Abstract

We introduce a general theorem framework for systems whose persistence depends on reconciling local transitions with whole-system viability. The framework is intentionally abstract: it applies to record-bearing, recursively constrained systems equipped with transitions, viability conditions, traces, channels, anchors or proxies, and a local-to-global compatibility relation. We then develop a theorem spine in three levels. First, a family of foothill theorems shows that local structural defects induce failure of corresponding system-level robustness properties. Second, a family of ridge theorems composes these failures into broader structural impossibility results concerning proxy guidance, local admissibility, correction through multiplicity, and viability support through sufficient capacity. Third, a summit abstraction, BoundaryDefect, unifies the main defect families and yields a general viability-boundary theorem: whenever a system exhibits any one of the identified boundary defects, it fails a corresponding schema of robust viable continuation. The abstract theorem family is fully proved in Lean; the domain sections that follow are interpretation schemas and corollary schemas, not full domain formalizations. The framework is machine-checked and is designed to support disciplined instantiation across diverse domains, including self-modifying AI systems, legal and institutional orders, organismal and ecological systems, markets, civilization-scale coordination systems, and other recursively constrained structures. Trust boundary. Machine-checked claims are those in \nolinkurlviable-continuation-lean matching . Domain vignettes and bridge narratives are schemas, not additional closed theorems unless a bridge module proves a toy witness. Summit anchors: \nolinkurlnecessary_conditions_for_robust_viable_continuation; \nolinkurlgeneral_viability_boundary.

Zenodo (CERN European Organization for Nuclear Research)
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.