ZF209: exact independence claim for the 209-state machine
OpenPalomarZF209.exact209ClaimThis is the statement of record for the -state machine. There is a closed sentence of the language of set theory such that: (i) in every nonempty model of , under every assignment, holds exactly when the machine has an internally finite blank-tape halting history; (ii) if is consistent, then does not prove ; and (iii) if is arithmetically -sound, then proves neither nor .
The sentence is not fixed in advance: the claim asserts the existence of a sentence with the stated meaning and unprovability properties. The uniform meaning of and the correctness of the compilation into the machine are conclusions of the proof, not assumptions. This is PalomarZF209.Exact209Claim, proved in the source repository by Solution.lean via Halting/Final.lean with only propext, Classical.choice, and Quot.sound.
Formalization Note Exact209Claim is a transparent proposition in the standalone statement layer; the goal is to prove it from the imported definitions.
import Definitions.Def_PalomarZF209_History import Definitions.Def_PalomarZF209_SetTheory import Definitions.Def_PalomarZF209_Arithmetic
namespace PalomarZF209 theorem exact209Claim : Exact209Claim := by sorry end PalomarZF209