Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

K230 halts iff ZFC is inconsistent

Open
K230.tm230_halts_iff_ZFC_inconsistent

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

The central result of the K230 development: the frozen 230-state binary Turing machine, started in state 0 on the all-zero tape, halts if and only if standard first-order ZFC proves a contradiction. This is the axiom-free theorem tm230_halts_iff_ZFC_inconsistent in Correct230.v. It is an external theorem about the machine and the theory; it does not assert that ZFC is consistent.

Preamble
import Definitions.Def_K230_tm
import Definitions.Def_K230_zfc
import Definitions.Def_K230_nd
import Definitions.Def_K230_fol
Formal statement
namespace K230
theorem tm230_halts_iff_ZFC_inconsistent : Halts c0 ↔ TPrv StandardZFC bot := by sorry
end K230
Source
https://github.com/elliotglazer/k230-rocq/blob/main/coq/tm/Correct230.v

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