ZF207 machine meaning: a halting sentence in every ZF model
OpenPalomarZF207.represents207_existsbusy-beaverincompletenessindependencemathematical-logicset-theoryturing-machineszf207
There exists a closed sentence of the language of set theory that expresses blank-tape halting of the literal 207-state machine in every model of ZF: Represents207 H, i.e. is closed and in every nonempty ZF model, under every assignment, holds iff the model contains an internally finite halting history (InternalLinkedHalts). This is the machine-meaning clause of Theorem 1.2; histories may have nonstandard length. In the source development the sentence is constructed by translating the physical halting sentence, and its meaning is proved in ZF207.Independence.haltSentence_represents.
Preamble
import Definitions.Def_palomar_zf207_history import Definitions.Def_palomar_zf207_zf import Definitions.Def_palomar_zf207_statement
Formal statement
namespace PalomarZF207 theorem represents207_exists : ∃ H : Formula, Represents207 H := by sorry end PalomarZF207
Source
James Chang, ZF207 paper (2026), Theorem 1.2 (first clause); production proof https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF207/ProofSources/Independence/Top.lean#L19-L37 (haltSentence, haltSentence_represents)