Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Distinct closure claims are jointly inconsistent

Proved
TranscendenceTower.Reification.closure_collide

by mateoej12 · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

formalizing-contextlogicnonmonotonic-logic

If S≠S′S \neq S'S=S′ then T0+CL(S)+CL(S′)T_0 + CL(S) + CL(S')T0​+CL(S)+CL(S′) has no model.

Two completeness claims about the same level, each honestly made, cannot both be held merely because each was made in good faith. Here CL(S)CL(S)CL(S) is the semantic condition that the extension of True0True_0True0​ is exactly SSS, so the collision is immediate: no model gives True0True_0True0​ two different extensions, and T0T_0T0​ plays no part in the argument. Read as axiom schemas, the same collision is syntactic: choosing a code in S∖S′S \setminus S'S∖S′, the first closure claim yields φ\varphiφ and the second yields ¬φ\neg\varphi¬φ.

This distinguishes closure claims sharply from ordinary assertions. Two ordinary claims about different subjects coexist without difficulty, whereas two closure claims about the same level are in direct contradiction whenever their extents differ at all. The practical consequence is that an unrelativized completeness claim is incompatible with any other completeness claim of different extent, including one made later by the same agent about the same level after the level has changed.

Limits. The formal content is elementary: under this encoding the theorem amounts to the fact that a set cannot equal two different sets. Its interest lies in the reading above, not in the difficulty of the proof.

Preamble
import Definitions.Def_TranscendenceTowerReification

set_option autoImplicit false
Formal statement
namespace TranscendenceTower.Reification

theorem closure_collide : ∀ (S S' : Set L0), S ≠ S' →
    ¬ ∃ M : RStruc, SatT0 M ∧ SatCL M S ∧ SatCL M S' := by sorry

end TranscendenceTower.Reification
Source
Mateo Estrada, Harmless and Pointless: Consistency, rigidity, and the indeterminacy of context transfer in McCarthy's formalization of context, 7 September 2026, Section 3, Theorem 6.

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