The transcendence tower is consistent at every ordinal stage
ProvedTranscendenceTower.Transfinite.Gamma_satisfiableMcCarthy explicitly raises, and then sets aside, the possibility of continuing the process of transcending contexts transfinitely. This theorem settles that case: for every ordinal , the transcendence schema extended to stage ,
is satisfiable, and therefore consistent.
The finite case already shows that no self-referential paradox can arise, because strict stratification makes the Liar syntactically unwritable. What the transfinite case adds is the limit stages, where infinitely many earlier stages must cohere simultaneously. The theorem states that nothing goes wrong there either, no matter how far the tower is carried.
Formalization note. Stated as satisfiability by an explicit valuation, following the pattern of the finite case. The scope limitation of the finite result carries over unchanged: this is the schema in which each context faithfully copies the one below, not the case in which a transcending context relaxes an assumption of the old.
Retired because it is superseded by TranscendenceTower.Transfinite.Gamma_satisfiable_compositional, whose statement makes the intended semantic strength explicit.
import Definitions.Def_TranscendenceTowerTransfinite set_option autoImplicit false
namespace TranscendenceTower.Transfinite
theorem Gamma_satisfiable :
∀ (α : Ordinal), ∃ v : TForm → Bool, ∀ q ∈ Gamma α, v q = true := by sorry
end TranscendenceTower.Transfinite