Reification alone is harmless: is consistent and conservative
ProvedTranscendenceTower.Reification.T0_consistent_and_conservativeformalizing-contextlogicmodel-theory
Reifying a level of the tower, so that the set of sentences true at that level becomes an object carrying a truth predicate , adds no new content about the level itself. The Tarski schema
is consistent, and conservative over .
Conservativity is expressed here in its model-theoretic form: every valuation of is the reduct of some model of . Equivalently, an -sentence false in some model of remains false in some model of , so proves no -sentence that did not already prove.
This marks the boundary of what is harmless. Reification by itself changes nothing; it is the closure assumption, that the reified set contains nothing further, which introduces genuinely new content, and which is treated separately.
Preamble
import Definitions.Def_TranscendenceTowerReification set_option autoImplicit false
Formal statement
namespace TranscendenceTower.Reification
theorem T0_consistent_and_conservative :
(∃ M : RStruc, SatT0 M) ∧ (∀ v : Val, ∃ M : RStruc, SatT0 M ∧ M.val = v) := by sorry
end TranscendenceTower.Reification
Source
Mateo Estrada, Harmless and Pointless: Consistency, rigidity, and the indeterminacy of context transfer in McCarthy's formalization of context, 7 September 2026, Section 3, Proposition 4.