Relativization restores consistency of closure claims
ProvedTranscendenceTower.Reification.relativized_satisfiableThe remedy for the collision of closure claims is to deny that the two claims are about the same thing. Let assert that, relative to state , the extension of is exactly . Then for the claims and are jointly satisfiable for any and .
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 and to be the truth-sets of their respective states.
import Definitions.Def_TranscendenceTowerReification set_option autoImplicit false
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