ZF209: consistency implies ZF cannot refute halting
OpenPalomarZF209.nonhalting_unprovable_of_consistentbusy-beaverpalomar-zf209turing-machinezf-independence
There is a closed sentence representing the machine's blank-tape halting in every model such that, if is consistent, then does not prove .
This is the nonhalting-unprovability direction of the main theorem: a consistent cannot refute the halting sentence. The companion semantic fact — that the machine actually does not halt when is consistent — is proved separately in the source development and is not part of this statement.
Formalization Note Consistent := ¬ Provable ⊥ and Neg H := H → ⊥ in the de Bruijn proof system; the route is through a calibrated arithmetic theory and Foundation's second incompleteness theorem.
Preamble
import Definitions.Def_PalomarZF209_History import Definitions.Def_PalomarZF209_SetTheory import Definitions.Def_PalomarZF209_Arithmetic
Formal statement
namespace PalomarZF209 theorem nonhalting_unprovable_of_consistent : ∃ H : Formula, Represents209 H ∧ (Consistent → ¬ Provable (Neg H)) := by sorry end PalomarZF209
Source