Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ZF209: consistency implies ZF cannot refute halting

Open
PalomarZF209.nonhalting_unprovable_of_consistent

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

busy-beaverpalomar-zf209turing-machinezf-independence

There is a closed sentence HHH representing the machine's blank-tape halting in every ZF\mathrm{ZF}ZF model such that, if ZF\mathrm{ZF}ZF is consistent, then ZF\mathrm{ZF}ZF does not prove ¬H\neg H¬H.

∃H, Represents209(H)∧(Consistent→¬ Provable(¬H)).\exists H,\ \mathrm{Represents209}(H)\wedge\bigl(\mathrm{Consistent}\to\neg\,\mathrm{Provable}(\neg H)\bigr).∃H, Represents209(H)∧(Consistent→¬Provable(¬H)).

This is the nonhalting-unprovability direction of the main theorem: a consistent ZF\mathrm{ZF}ZF cannot refute the halting sentence. The companion semantic fact — that the machine actually does not halt when ZF\mathrm{ZF}ZF 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
https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/paper/zf209.tex (Theorem 1.2(1), thm:main); proof: https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/ProofSources/Halting/Final.lean and https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/ProofSources/Independence/Godel.lean

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me