Change sets parametrise the relaxed models by the subsets of the relaxation set
ProvedTranscendenceTower.MinimalChange.delta_bijectionformalizing-contextlogicmodel-theory
The change set is a bijection from the -relaxed models onto the subsets of : it is injective on , and every is realised.
Injectivity holds because truth values are Boolean. Knowing where a context departs from the base determines what it says there, since only one alternative value is available. Surjectivity is witnessed by flipping exactly the assumptions in .
Quantitatively, relaxing assumptions leaves exactly transcending contexts, and they are in exact correspondence with the ways of choosing which relaxed assumptions to actually change. The relaxed schema constrains nothing further.
Preamble
import Definitions.Def_TranscendenceTowerMinimalChange set_option autoImplicit false open TranscendenceTower TranscendenceTower.Relaxation
Formal statement
namespace TranscendenceTower.MinimalChange
theorem delta_bijection (v : Atom 0 → Bool) (A : Set (Lang 0)) :
(∀ N₁ ∈ Mod v A, ∀ N₂ ∈ Mod v A, Delta v N₁ = Delta v N₂ → N₁ = N₂)
∧ (∀ S : Set (Lang 0), S ⊆ A → ∃ N ∈ Mod v A, Delta v N = S) := by sorry
end TranscendenceTower.MinimalChange
Source
Mateo Estrada, Harmless and Pointless: Consistency, rigidity, and the indeterminacy of context transfer in McCarthy's formalization of context, 7 September 2026, Section 5, Theorem 9.