ZF209: Sigma_1-soundness implies ZF cannot prove halting
OpenPalomarZF209.halting_unprovable_of_sigma1_soundbusy-beaverpalomar-zf209turing-machinezf-independence
There is a closed sentence representing the machine's blank-tape halting in every model such that, if is arithmetically -sound, then does not prove .
This is the halting-unprovability direction of the main theorem under the stronger arithmetic -soundness hypothesis. Together with the nonhalting direction (which needs only consistency), it yields full independence of the halting sentence.
Formalization Note ArithmeticSigma1Sound quantifies over closed arithmetic sentences represented in 's natural numbers; the source converts it to the production soundness hypothesis via a bridge.
Preamble
import Definitions.Def_PalomarZF209_History import Definitions.Def_PalomarZF209_SetTheory import Definitions.Def_PalomarZF209_Arithmetic
Formal statement
namespace PalomarZF209 theorem halting_unprovable_of_sigma1_sound : ∃ H : Formula, Represents209 H ∧ (ArithmeticSigma1Sound → ¬ Provable H) := by sorry end PalomarZF209
Source