ZF207: -soundness implies unprovability of halting
OpenPalomarZF207.halt_unprovable_of_sigma1_soundbusy-beaverincompletenessindependencemathematical-logicset-theoryturing-machineszf207
Let be any closed set-theoretic sentence that expresses blank-tape halting of the literal 207-state machine in every ZF model (Represents207 H). If ZF is arithmetically -sound, then ZF does not prove . This is the halting direction of Theorem 1.2(2), in lemma form generalized over the representing sentence. In the source it follows by proving for a halting sentence , applying soundness, and invoking nonhalting under consistency (literal207_physical_unprovable).
Preamble
import Definitions.Def_palomar_zf207_history import Definitions.Def_palomar_zf207_zf import Definitions.Def_palomar_zf207_statement
Formal statement
namespace PalomarZF207 theorem halt_unprovable_of_sigma1_sound (H : Formula) (hH : Represents207 H) : ArithmeticSigma1Sound → ¬ Provable H := by sorry end PalomarZF207
Source
James Chang, ZF207 paper (2026), Theorem 1.2(2); production proof https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF207/ProofSources/Literal207SigmaSoundness.lean#L36-L57 and https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF207/ProofSources/Independence/Top.lean#L39-L52