ZF209: a sentence represents halting in every ZF model
OpenPalomarZF209.represents209_existsThere is a closed sentence of the language of set theory whose meaning in every nonempty model of is exactly the model-internal blank-tape halting of the -state machine: under every assignment, holds if and only if InternalLinkedHalts E holds.
This is the representation (machine-meaning) clause of the main theorem. The halting history is internally finite and may have nonstandard length, so the sentence must be correct in every model, including those with nonstandard natural numbers. It is the conclusion that the compiled halting sentence correctly expresses halting, rather than an assumption supplying an unspecified machine predicate.
Formalization Note Represents209 H requires Closed H and the equivalence eval E H s ↔ InternalLinkedHalts E for every nonempty Model E and assignment s.
import Definitions.Def_PalomarZF209_History import Definitions.Def_PalomarZF209_SetTheory import Definitions.Def_PalomarZF209_Arithmetic
namespace PalomarZF209 theorem represents209_exists : ∃ H : Formula, Represents209 H := by sorry end PalomarZF209