Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. Under PSC-style closure, stable records, and diagonal capability (Papers 27, 29), one cannot simultaneously hold a strong factorization locality axiom (Paper 45) and local semantic determinacy—that world-type is computed from local views in a total-effective way. We prove a no-go: any such procedure would decide an extensional nontrivial predicate on a diagonal-capable domain and thus contradict the selector-strength barrier. So total-effective local semantic determinacy must fail (factorization can hold). This is semantic nonlocality in the effective sense, without implying superluminal signalling. The result is mechanized in Lean 4 (CausalNonlocality); the barrier witness is parametric in the fixed-point premise (0 axioms). Paper 47 (No Spooky-to-Signal Compiler) builds on this. Trust boundary. The no-go combines Paper 45 factorization with a total-effective local semantic determinacy hypothesis; it does not assert superluminal signalling. Mechanization is nems-lean . See .
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. Under PSC-style closure, stable records, and diagonal capability (Papers 27, 29), one cannot simultaneously hold a strong factorization locality axiom (Paper 45) and local semantic determinacy—that world-type is computed from local views in a total-effective way. We prove a no-go: any such procedure would decide an extensional nontrivial predicate on a diagonal-capable domain and thus contradict the selector-strength barrier. So total-effective local semantic determinacy must fail (factorization can hold). This is semantic nonlocality in the effective sense, without implying superluminal signalling. The result is mechanized in Lean 4 (CausalNonlocality); the barrier witness is parametric in the fixed-point premise (0 axioms). Paper 47 (No Spooky-to-Signal Compiler) builds on this. Trust boundary. The no-go combines Paper 45 factorization with a total-effective local semantic determinacy hypothesis; it does not assert superluminal signalling. Mechanization is nems-lean . See .
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. We adopt a strong locality axiom at the Holds level: factorization—global satisfaction of observational propositions is the conjunction over fragments of a local predicate applied to the restricted world. This is algebraic, not geometric; no spacetime structure is assumed. Under factorization, same local views (same restriction at every fragment) imply observational equivalence; hence world-type is determined by the global map from fragments to local views. Interpretation: local dynamics alone do not guarantee local semantic closure; semantics is glued globally. A minimal toy (two fragments, observables as per-fragment claims) witnesses factorization and the main theorem. The development is mechanized in Lean 4 as the SemanticNonlocality library in nems-lean, with zero sorry and no custom axioms. Trust boundary. Factorization is an algebraic \Holds-level axiom, not a spacetime locality claim; interpretive "nonlocality" language is about semantic gluing, not signalling. Mechanization is nems-lean . See .
Papers 45–46 showed that under PSC and diagonal capability, semantics is glued globally and total-effective local semantic determinacy is impossible. This paper proves a theorem-grade constraint on FTL: no total-effective internal procedure can implement a total-effective signalling extractor—i.e. a decider for a nontrivial extensional predicate of the globally glued semantics—without amounting to an internal oracle or selector. We define a spooky-to-signal compiler (informally: the same object as a signalling extractor) for such a predicate T as a total decider for T (not merely correlated); the barrier (Paper 29) then yields that no such signalling extractor exists. So EPR-style correlations cannot be total-effectively upgraded to controllable signalling—a NEMS-native reframing of "why EPR \neq FTL." The result is mechanized in Lean 4 (FTLConstraints); 0 axioms. No claim of superluminal kinematics; the constraint is on effective conversion. Trust boundary. The no-spooky-to-signal result is a theorem about total-effective internal extractors/deciders for glued semantics; it does not analyze experimental signalling protocols outside that formalization. Mechanization is nems-lean . See .
A Kernel-Role Determinacy Theorem for Bell-Witness Fixation, No-Signaling, and Tensor-Level Compatibility This manuscript develops a fixed-domain AASC analysis of Bell-nonlocal quantum entanglement as a theorem of reusable witness determinacy. It does not introduce hidden variables, modify quantum mechanics, derive Hilbert-space formalism from below, or propose a new signaling mechanism. Instead, it asks a prior structural question: once a Bell-type operational family is used as the same non-degenerate witness across settings, lawful transformations, retained records, comparison, and later classification, what admissible same-domain standing form is forced? The governing claim is that AASC is not an optional interpretive overlay on physics. Once an operational Bell family is asserted as a determinate reusable witness, admissibility, standing, reference, and irreversibility are already active as minimal necessity conditions of same-witness objecthood. Target instantiation therefore carries governance occupancy: an alleged determinate Bell witness with no admissible governance realization is not an empty alternative, but a refusal or retyping of the target. The manuscript defines finite operational Bell objects with explicit setting carriers, outcome families, channel/interface data, standing-token valuations, continuation and report/reuse structure, comparison profiles, and act-time status. It then defines object-indexed query sorts, dependent response families, exactly recoverable operational simulations, lawful Bell groupoids, six governance-effect functors, and target-active extensional governance equivalence. The result is a typed interface in which arbitrary native formalisms can be compared by their target-bearing governance effects rather than by their internal syntax. The central Bell-specific theorem states that every same-target candidate-admissible Bell-governance construction is forced component by component into the certified boundary-compatible standing form on the complete target-active practice. Candidate admissibility does not assume the canonical form at the outset. Instead, target occupancy, lawful transport, standing-flow exclusion, compatibility certification, coordinate-deviation exhaustion, and componentwise closure force exact target-bearing realization and governance equivalence to the canonical representative CP∗C^{*}_{P}CP∗. The target-induced governance quotient therefore has exactly one element. The Bell carrier is treated as a compatible empirical model on a finite measurement cover. Bell-local completion is identified with the existence of a global section, and Bell nonlocality is the obstruction to such a section. The manuscript separates operational marginal invariance, absence of controllable communication, and exclusion of same-domain standing transport. No-signaling is therefore preserved without retyping Bell nonlocality as superluminal communication, metric transport, distant repair, or hidden standing transfer. The finite-dimensional quantum specialization uses the standard bipartite tensor-product and local-POVM carrier. Every separable realization in that carrier is Bell-local; therefore, if the fixed Bell-nonlocal empirical model has such a finite-dimensional quantum realization, every realizing state in that carrier is entangled. Post-quantum Bell-nonlocal no-signaling models remain within the general witness theorem but outside the quantum-entanglement corollary. The accompanying Lean 4 development, release v0.8.0, directly verifies the finite Bell-side witness carrier: denominator-32 vector/Born weights, structural no-signaling, CHSH numerator 808080, all sixteen deterministic local extrema, finite denominator-32 Bell-local-envelope exclusion, and conditional endpoint routing. Its direct witness certificate is vectorBorn_flagship_spine, and its deepest released endpoint is reasonableDeepestFiniteEntanglement_spine. The manuscript-level typed governance interface, empirical lawful groupoid, compatibility equivalence, coordinate-deviation exhaustion, completed role collapse, candidate-to-canonical derivation, and finite-dimensional quantum specialization are not attributed to the released Lean layer. This paper is the Bell-witness member of the paired AASC quantum determinacy arc. The record-side manuscript, Admissible Record Construction in Physically Non-Selective Quantum Regimes, fixes when local physical record occurrences stand as the same evidential record objects. The present manuscript fixes when the Bell operational family sampled by such records stands as the same reusable witness. The paired endpoint is therefore: record-role fixation+Bell-witness compatibility.\text{record-role fixation} + \text{Bell-witness compatibility}.record-role fixation+Bell-witness compatibility. The manuscript is classificatory and eliminative rather than mechanistic. It does not claim that AASC generates the Bell probabilities or supplies a hidden physical influence. Its claim is that reusable Bell-witness determinacy strongly constrains how Bell-nonlocal correlations may be coherently classified on a fixed domain: not as independently complete local states later connected by a mechanism, not as Bell-local hidden-variable value assignments, not as superluminal signaling, and not as same-act repair, but as boundary-level compatibility carried by one standing-preserving Bell witness.
PSC forbids information "lost outside" the universe or true destruction without internal semantic closure. This paper applies NEMS and the hypercomputation taxonomy (Paper 35) to black hole information. We reframe the paradox in terms of record fragments (e.g., outside thermal, infalling, unitarity). We prove: (1) Record consistency (abstract): an information-erasing appearance (two worlds disagree on an observation) implies the semantics is not categorical (multiple world-types; selection is required). Classically (Choice), a selector exists; internal/effective selector is constrained by diagonal barriers (Papers 29/35). (2) No hypercomputing from black holes: under the same barrier assumptions (extensional + nontrivial predicate; anti-decider closure; \hFP), no internal total-effective black-hole decoder can decide a diagonal-capable predicate on the outcome space. Observer-relative records (complementarity) and islands/Page curve are interpreted as closure-driven reassignment; we do not assume any particular QG microphysics. The development is mechanized in Lean 4 as the BlackHoles library in nems-lean, with zero sorry and no custom axioms. Trust boundary. Record-consistency and no-hypercomputing claims are abstract and conditional on the Paper 29/35 barrier hypotheses; we do not assume a specific quantum-gravity completion. Mechanization is nems-lean . See .
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. This short note provides a fast, technically correct entry point into the NEMS Suite. The suite establishes a fixed-point architecture linking closure (Perfect Self-Containment, PSC) to quantum probability semantics (Born rule) at the level of macroscopic records. The core contributions are stated as a compact theorem ledger with explicit assumptions and a precise map of what is machine-checked in Lean versus what is cited as classical mathematics. We also provide an audit-style "where disagreement must occur" checklist: any critic must reject a specific named premise (records, closure, computation, semantic completeness, or classical linear-algebraic facts), rather than dismissing the framework as interpretive.
Programme status: This record belongs to an active research programme. It is not a finished or final theory. The framework is currently undergoing a systematic audit, together with corrections and improvements prompted by reader feedback. Several significant issues have been identified, and some claims, derivations and interpretations in the current version may be revised, qualified or withdrawn in future versions. Revised versions will be released when this work is complete. Status as of October 2026. The recursive-intelligence arc (Papers 56–60) establishes that what matters, what is known, and what affects structure must be semantically represented on-ledger. The remaining escape is: maybe there are real off-ledger entities—ghostly things not represented in the ledger. Paper 61 kills that move. We prove that any purported off-ledger entity is either determinacy-relevant (hence illicit under no-free-bits, Paper 27) or semantically inert (hence theory-null). No viable ontology of real-but-off-ledger ghost entities survives. Results are machine-checked in Lean 4 in the \pathGhostCollapse library of reflexive-closure-lean , with bridges to no-free-bits and \pathQualiaLedger. Trust boundary. The theorem targets ghost ontology (purported real-but-off-ledger entities), not every scientific use of "unobserved" structure. Hidden variables that affect adjudicatory structure must be ledger-relevant in the Paper 27 sense. See .