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 .
Nova Spivack (2026) studied this question.