The transcendence tower is consistent
ProvedTranscendenceTower.transcendence_tower_satisfiableIn Notes on Formalizing Context (1993), McCarthy observes that a formula is itself always asserted within some further context, so that one has "something like ", and remarks: "The regress is infinite, but we will show that it is harmless." The promised demonstration does not appear in the paper. This theorem is that claim, made precise and proved.
Work in the stratified tower of propositional languages , where adjoins one new atom for each . The transcendence schema is the set of all sentences
which is the formal content of McCarthy's stipulation that unconditional belief in at one level is equivalent to of one level up, iterated without bound. The theorem asserts that every instance of is true in the tower model , so is satisfiable and therefore consistent.
The reason it goes through is exactly the reason Tarski's hierarchy of truth predicates avoids the Liar paradox: strict stratification makes self-reference syntactically unrepresentable. No formula of can apply to itself, so no analogue of the Liar sentence, and no analogue of Russell's paradox for , can even be written down.
The result is deliberately modest in reach. The schema it proves consistent is the one McCarthy himself calls "pointless", in which each context faithfully copies the one below; each stage of the tower is in fact a definitional extension of the previous one. It says nothing about the case he identifies as interesting, in which a transcending context relaxes an assumption of the old, nor about the nonmonotonic specializes relation, lifting between non-nested contexts, or quantification over contexts as first-class terms.
Formalization note. is an increasing chain of classical valuations with ; satisfaction is stated as . The construction is elementary: no compactness theorem is required, only a direct limit of an increasing chain of valuations.
import Definitions.Def_TranscendenceTowerCore set_option autoImplicit false
namespace TranscendenceTower
theorem transcendence_tower_satisfiable :
∀ (n : Nat) (p : Lang n), Form.eval (M (n + 1)) (schema p) = true := by sorry
end TranscendenceTower