Axiom Dynamics 9: The Exact Boundary of Sequential Feasibility

Three earlier registrations in this series recorded three forms of the same gap.Paper 7, §8.4, asked whether every batch admits a legal sequential execution whenthe baseline is acyclic, premises are leaves, antecedents are single, and R ∪ X hasno candidate cycle (equal-value chains allowed). Paper 6, Theorem 3.2, assertedthat a purely expansive batch is reachable if and only if it has no deadlock subset, registering a direct implementation of that criterion as undecided. Paper 4,§8.6, asked whether sequential and batch legality still coincide when non-expansivecandidates such as contractions are admitted. This paper delivers each. To thefirst, an affirmative answer: requiring only that BR∪X have no derivational cycle,the reverse-elimination construction yields a legal order in polynomial time. To thesecond, a correction: “reachable implies no deadlock subset” fails, with a bitwisehand-checked counterexample; the exact criterion is a recursive property along theelimination chain, not reducible to a static subset predicate, and deadlock detectionin this candidate space drops from enumerating 2|X| subsets to |X| + 1 closures.To the third, a layer attribution: the boundary of consistency failure is not expansive versus non-expansive, but additive ledger (forward) versus set monotonicity(backward). The mechanism compresses to one sentence: leaf premises give eachcandidate’s outgoing edge exclusive ownership — every new pair’s first coordinatebelongs to some premise class, and chains change propagation but not ownership;hence shadowing must be recomputed stage by stage in the augmented system, andstatic blocking by the baseline relation necessarily misses it. As a corollary, thethird clause of Paper 7, §8.5 — “candidate cycles themselves do not cause sequential infeasibility” — fails as a universal statement: a minimal counterexample onthree atoms is given. A complete criterion for the cyclic case follows: reachabilityholds if and only if the elimination core Core(X) = ∅, decided by polynomial Algorithm 7.9, with Proposition 7.10 giving the bound O(|X|2 · |A| · (|R| + |X|)). Asa by-product, the polynomial upper bound closes the 2|X| enumeration open itemregistered in Paper 6. All structural assertions are paired with a machine-checkledger R1–R15: R1–R12 in Chapter 2 and R13–R15 in Appendix A, pushing exhaustive corpora to the full n = 4 space and n = 5 with |X| ≤ 10, with the firstregistration of three families of minimal obstructed shapes.

Authors

Publication Details

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

Axiom Dynamics 9: The Exact Boundary of Sequential Feasibility

changzheng zhou, ziqing zhou
Zenodo (CERN European Organization for Nuclear Research)
Logic, Reasoning, and Knowledge
preprint

Axiom Dynamics 9: The Exact Boundary of Sequential Feasibility

changzheng zhou, ziqing zhou
preprint en

Abstract

Three earlier registrations in this series recorded three forms of the same gap.Paper 7, §8.4, asked whether every batch admits a legal sequential execution whenthe baseline is acyclic, premises are leaves, antecedents are single, and R ∪ X hasno candidate cycle (equal-value chains allowed). Paper 6, Theorem 3.2, assertedthat a purely expansive batch is reachable if and only if it has no deadlock subset, registering a direct implementation of that criterion as undecided. Paper 4,§8.6, asked whether sequential and batch legality still coincide when non-expansivecandidates such as contractions are admitted. This paper delivers each. To thefirst, an affirmative answer: requiring only that BR∪X have no derivational cycle,the reverse-elimination construction yields a legal order in polynomial time. To thesecond, a correction: “reachable implies no deadlock subset” fails, with a bitwisehand-checked counterexample; the exact criterion is a recursive property along theelimination chain, not reducible to a static subset predicate, and deadlock detectionin this candidate space drops from enumerating 2|X| subsets to |X| + 1 closures.To the third, a layer attribution: the boundary of consistency failure is not expansive versus non-expansive, but additive ledger (forward) versus set monotonicity(backward). The mechanism compresses to one sentence: leaf premises give eachcandidate’s outgoing edge exclusive ownership — every new pair’s first coordinatebelongs to some premise class, and chains change propagation but not ownership;hence shadowing must be recomputed stage by stage in the augmented system, andstatic blocking by the baseline relation necessarily misses it. As a corollary, thethird clause of Paper 7, §8.5 — “candidate cycles themselves do not cause sequential infeasibility” — fails as a universal statement: a minimal counterexample onthree atoms is given. A complete criterion for the cyclic case follows: reachabilityholds if and only if the elimination core Core(X) = ∅, decided by polynomial Algorithm 7.9, with Proposition 7.10 giving the bound O(|X|2 · |A| · (|R| + |X|)). Asa by-product, the polynomial upper bound closes the 2|X| enumeration open itemregistered in Paper 6. All structural assertions are paired with a machine-checkledger R1–R15: R1–R12 in Chapter 2 and R13–R15 in Appendix A, pushing exhaustive corpora to the full n = 4 space and n = 5 with |X| ≤ 10, with the firstregistration of three families of minimal obstructed shapes.

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.

Laika access coming soon