Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Relativization restores consistency of closure claims

Proved
TranscendenceTower.Reification.relativized_satisfiable

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

formalizing-contextlogicnonmonotonic-logic

The remedy for the collision of closure claims is to deny that the two claims are about the same thing. Let CL(S,c)CL(S,c)CL(S,c) assert that, relative to state ccc, the extension of True0True_0True0​ is exactly SSS. Then for c≠c′c \neq c'c=c′ the claims CL(S,c)CL(S,c)CL(S,c) and CL(S′,c′)CL(S',c')CL(S′,c′) are jointly satisfiable for any SSS and S′S'S′.

The two axioms constrain the predicate at different indices, so the derivation behind the inconsistency of unrelativized closure, which required both claims to constrain the same extension, is simply unavailable.

The moral is that a completeness claim must carry the state it was computed against. An unrelativized closure claim is not merely imprecise; it is incompatible with any other closure claim of different extent. Relativization is what makes a completeness claim into something that can be superseded rather than contradicted.

Formalization note. This proposition concerns the closure axioms themselves. Adding the relativized Tarski schema as well would additionally constrain SSS and S′S'S′ to be the truth-sets of their respective states.

Preamble
import Definitions.Def_TranscendenceTowerReification

set_option autoImplicit false
Formal statement
namespace TranscendenceTower.Reification

theorem relativized_satisfiable : ∀ (State : Type) (c c' : State), c ≠ c' →
    ∀ (S S' : Set L0),
      ∃ F : RFamily State, SatCLat F S c ∧ SatCLat F S' c' := 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, the relativized remedy discussed after Theorem 6 (supporting result, not numbered in the paper).

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