Tarskian truth theories over set theory

Abstract: This work uses mostly model-theoretic methods to establish new proof-theoretic theorems about several axiomatic theories of truth over KP (Kripke-Platek set theory) and stronger theories, especially ZF (Zermelo-Fraenkel set theory).

• The paper’s main contribution is its systematic framework for extending ZF with a compositional Tarskian truth predicate and establishing deductive closure equivalences.
• It precisely characterizes set-theoretical consequences by linking truth predicates to hierarchies of consistency assertions and internal reflection principles.
• The study demonstrates model-existence and conservativity results through advanced model-theoretic techniques, clarifying the limits and strengths of these truth-theoretic extensions.

Authoritative Essay: "Tarskian Truth Theories over Set Theory" (2604.03825)

Introduction and Scope

The paper provides a systematic, highly technical treatment of Tarskian truth theories formulated over set-theoretic backgrounds, centering on extensions of the Zermelo-Fraenkel system, ZF, with a compositional truth predicate, denoted $\mathsf{T}$. The minimal theory, $\mathsf{CT}^{-}[\mathsf{ZF}]$, augments ZF with finitely many Tarski-style axioms capturing compositional truth (closure of $\mathsf{T}$ under logical connectives and quantifiers). A focal point is $\mathsf{CT}_{\ast}[\mathsf{ZF}]$, defined as $\mathsf{CT}^{-}[\mathsf{ZF}]$ further extended with the global reflection principle: "All theorems of $\mathsf{ZF}$ are true."

The paper investigates the deductive strength, interpretability, and conservativity of these truth-theoretic extensions, contextualizing them within both existing set-theoretic literature and arithmetical analogues. The results are positioned against classical and contemporary work, such as Montague's Reflection Theorem, Levy's Partial Definability, and Krajewski's conservativity results. Strong emphasis is placed on the model-theoretic and proof-theoretic interplay of truth predicates with foundational schemes of set theory (separation, collection, replacement, induction), and on their analogues in theories of classes (e.g., Gödel-Bernays).

Principal Results

Categorization of Deductive Closures

Theorem A establishes deductive closure equivalence among several truth-theoretic extensions:

• $\mathsf{CT}_{\ast}[\mathsf{ZF}]$
• $\mathsf{CT}^{-}[\mathsf{ZF}]$ plus internal replacement and disjunctive correctness outside
• $\mathsf{CT}^{-}[\mathsf{ZF}]$ plus internal reflection

Internal versions of replacement, separation, and reflection assert the truth of all respective instances in the sense specified by $\mathsf{T}$. Disjunctive Correctness (DC$\mathsf{CT}^{-}[\mathsf{ZF}]$0) ensures that the truth of a finite disjunction entails the truth of one of its disjuncts. The equivalence shows that the addition of global reflection for ZF-theorems is, in effect, matched by the closure of the truth predicate under internal replacement and reflection principles.

Characterization of Set-Theoretic Consequences

Theorem B provides a precise characterization of $\mathsf{CT}^{-}[\mathsf{ZF}]$1's $\mathsf{CT}^{-}[\mathsf{ZF}]$2-consequences: for any sentence $\mathsf{CT}^{-}[\mathsf{ZF}]$3 in the language of set theory,

• $\mathsf{CT}^{-}[\mathsf{ZF}]$4 if and only if
• $\mathsf{CT}^{-}[\mathsf{ZF}]$5 plus a hierarchy of consistency assertions for logical depth $\mathsf{CT}^{-}[\mathsf{ZF}]$6 (`$\mathsf{CT}^{-}[\mathsf{ZF}]$7' for all $\mathsf{CT}^{-}[\mathsf{ZF}]$8) proves $\mathsf{CT}^{-}[\mathsf{ZF}]$9.

This result aligns $\mathsf{T}$0 deductively with the union of all finite consistency extensions of ZFC, paralleling results from arithmetic (e.g., for $\mathsf{T}$1 and $\mathsf{T}$2).

Hierarchical Model-Existence Theorems

Theorem C articulates strict hierarchies among truth-theoretic extensions:

• The existence of a well-founded model of ZF is provable in $\mathsf{T}$3-Separation, but not in $\mathsf{T}$4 alone.
• The existence of a model in the form $\mathsf{T}$5 becomes provable only after further extension with $\mathsf{T}$6-collection.

These results delineate the precise impact of additional set-theoretic axioms extended to formulae mentioning $\mathsf{T}$7, and provide explicit counterexamples separating the strength of systems with and without these extensions.

Conservativity

Theorem D demonstrates that $\mathsf{T}$8 is conservative over $\mathsf{T}$9: every $\mathsf{CT}_{\ast}[\mathsf{ZF}]$0-sentence provable in this theory is already provable in ZF. The result is obtained via model-theoretic techniques leveraging elementary end-extensions and satisfaction class construction, aligning with advanced results in arithmetic truth theory.

Technical Innovations and Contrasts

The development and comparison of various truth theories over set backgrounds ($\mathsf{CT}_{\ast}[\mathsf{ZF}]$1, $\mathsf{CT}_{\ast}[\mathsf{ZF}]$2, $\mathsf{CT}_{\ast}[\mathsf{ZF}]$3, etc.) are underpinned by detailed analyses of the internal and external closure properties of the truth predicate. The identification of multiple deductively equivalent axiomatizations (the "many faces" theorem) for $\mathsf{CT}_{\ast}[\mathsf{ZF}]$4 enables robust transfer of techniques between model-theoretic and proof-theoretic contexts.

The paper generalizes several classical arithmetical results (e.g., conservativity theorems, reflection principles, speed-up results) to the set-theoretic field, including adaptation of methods for constructing full satisfaction classes, and the use of cuts and hierarchies (depth, $\mathsf{CT}_{\ast}[\mathsf{ZF}]$5) reminiscent of approaches in arithmetic. Of particular note is the thorough mapping between truth theories over ZF and their natural analogues in the Gödel-Bernays class theory context, establishing mutual interpretability and aligning their set-theoretic consequences.

Explicit counterexamples and constructions elucidate fine distinctions (e.g., pointwise definable minimal models, Paris models, models with or without access to well-foundedness), and demonstrate the boundaries of provability among the hierarchy of truth-theoretic extensions.

Strong Numerical Results and Bold Claims

• Deductive closure equivalence: Multiple truth-theoretic systems ($\mathsf{CT}_{\ast}[\mathsf{ZF}]$6, $\mathsf{CT}_{\ast}[\mathsf{ZF}]$7-Repl, etc.) yield identical sets of theorems in their extension.
• Set-theoretical consequences: $\mathsf{CT}_{\ast}[\mathsf{ZF}]$8 has precisely the $\mathsf{CT}_{\ast}[\mathsf{ZF}]$9-consequences as ZFC extended by all consistency assertions of finite logical depth.
• Unprovability of $\mathsf{CT}^{-}[\mathsf{ZF}]$0-model existence in $\mathsf{CT}^{-}[\mathsf{ZF}]$1: Despite proving the consistency of ZF, $\mathsf{CT}^{-}[\mathsf{ZF}]$2 does not ascertain the existence of an $\mathsf{CT}^{-}[\mathsf{ZF}]$3-model of ZF, providing a strict separation in strength.
• Conservativity of collection-extended truth theory: Adding collection to compositional truth over ZF, even with the truth predicate, does not increase deductive power in the set language.

Implications and Speculation

Theoretical Implications

The results obtained establish a robust taxonomy of truth-theoretic extensions of ZF, clarifying the impact of compositional truth on foundational schemes and set-theoretic strength. The equivalence of deductive closure among several systems provides a canonical framework for understanding the interaction of reflection and replacement with truth. The characterization of $\mathsf{CT}^{-}[\mathsf{ZF}]$4-consequences in terms of consistency hierarchies precisely situates truth-theoretical strength relative to traditional set-theoretic extensions.

Moreover, the paper demonstrates that the addition of global reflection (in the form "all theorems of ZF are true") does not increase the set-theoretical consequences beyond those obtainable by iterative consistency extensions, marking a clear boundary between expressive strength and foundational commitment.

The separation results concerning $\mathsf{CT}^{-}[\mathsf{ZF}]$5-models and well-foundedness (provable only with further scheme extension) identify critical loci of strength, informing both set-theoretic and truth-theoretic axiom selection.

Practical Implications and Future Directions

Practically, these findings inform the use of truth predicates in set-theoretic foundations, especially in contexts requiring compositional truth for formalization or philosophical analysis. The conservativity results assure that extending ZF with compositional truth (and even with collection) does not risk unintended consequences in terms of set-theoretic provability. They further clarify the boundaries of such extensions when considering their utility in mathematical logic or foundations.

The identification of mutual interpretability between truth theory and class theory inspires approaches in which axiomatic theories of truth are deployed within or alongside class-theoretic frameworks, facilitating transfer of results and techniques.

Future developments may include further refinement of the speed-up results and interpretability hierarchy, adaptations of the model-theoretic methods to other fragments of ZF or alternate set-theoretic backgrounds, and the exploration of nonstandard models, satisfaction classes, and their impact on truth-theoretic strength.

There also remain several open questions concerning proof-theoretic characterization, the existence of well-founded models relative to further truth-theoretic extensions, and the potential for superpolynomial speed-up in collection-augmented compositional truth theories.

Conclusion

The paper delivers a comprehensive and highly technical analysis of Tarskian truth theories over set theory, rigorously delineating their deductive closures, structural relationships, and implications for set-theoretic foundations. Through model-theoretic and proof-theoretic methods, the work maps the landscape of compositional truth in set contexts, clarifying its conservativity, strength, and limitations. This synthesis of truth-theory and set-theory provides authoritative guidance for further foundational research and informs the deployment of truth predicates in mathematical logic.