Tarski-style axiomatic truth theories
Ali Enayat
University of Gothenburg
The origins of the area known as Formal/Axiomatic Theories of Truth lie in Tarski’s explication of the notion of ‘truth in a structure’, and his famous theorem about undefinability of truth. Over the past decades, substantive contributions of a number of logicians – of both mathematical and philosophical persuasions – have enriched the subject’s literature.
In this tutorial I will focus on Tarski-style axiomatic truth theories over arithmetic and set theory, with an emphasis on the use of model-theoretic techniques for extracting conservativity, interpretability, and other proof-theoretic information.
The first lecture presents an overview of the general concepts, questions, techniques, and results of the subject, with emphasis on truth theories over (Peano Arithmetic). We will see the proof outline of the model-theoretic proof of conservativity of the truth theory known as (an extension of with a compositional truth predicate, the minus superscript indicates that there is no additional induction in the extended language). The proof methodology will be shown to be quite versatile and capable of establishing many other conservativity results. Moreover, it lends itself to appropriate arithmetizations that yield the interpretability of in , and the feasible proof-theoretic reducibility of to .
The second lecture concerns the ‘many faces theorem’ of the canonical extension of , which includes a modicum of induction, namely -induction for formulae involving the truth predicate. This theorem suggests that is the weakest theory among ‘natural’ nonconservative extensions of . We will also explore the intimate relationship between and a well-known strengthening of the fragment of second order arithmetic.
The focus of the third lecture is on truth theories over (Zermelo–Fraenkel set theory). We will first go through some old and new conservativity results concerning , and will then we examine certain nonconservative extensions of that emerge from the search for the set-theoretical counterpart of .
Slides for Lecture 1-3. (Including an additional Preamble containing learning resources.)