The transfinite tower has a compositional model
ProvedTranscendenceTower.Transfinite.Gamma_satisfiable_compositionalFor every ordinal stage and every assignment to the base atoms, the canonical recursively defined valuation satisfies every instance of the transcendence schema at that stage.
The proof uses the defining equation for the stratified truth operator: evaluating gives exactly the value of .
- Take an arbitrary schema member .
- Unpack membership to obtain , a formula , and .
- Both sides of the biconditional evaluate identically by definition, so the biconditional evaluates to true.
Formalization note: the statement names the recursive evaluator val v0 explicitly. It does not quantify over an unconstrained function from formulas to Booleans, so propositional compositionality is built into the witness and the constant-true function is excluded. That is all the explicit evaluator excludes; see Limits.
This result concerns the stratified propositional tower only. It does not cover a language with unrestricted self-reference or first-class quantification over contexts.
Limits. The content is small. Because val evaluates as , every instance of the schema reduces to , and the staging hypotheses and are never used: the same valuation satisfies every instance of the schema, well staged or not. The stratification does no work in this statement. What rules out a Liar-style instance is that formulas are finite trees, so no formula occurs inside itself, and that is a property of the syntax rather than of the ordinal staging. The result shows that the transfinite tower is harmless; it does not show that stratification is what makes it so.
import Definitions.Def_TranscendenceTowerTransfinite set_option autoImplicit false open TranscendenceTower.Transfinite
theorem TranscendenceTower.Transfinite.Gamma_satisfiable_compositional :
∀ (α : Ordinal) (v0 : Nat → Bool),
∀ q ∈ Gamma α, val v0 q = true := by sorry