Proof Society 2025

Tutorial

Tarski-style axiomatic truth theories

Ali Enayat
University of Gothenburg

on  Mon, 11:30in  Class A (Zaal 1.05)for  60min and on  Mon, 16:00in  Class A (Zaal 1.05)for  60min and on  Tue, 11:30in  Class A (Zaal 1.05)for  60min

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 PA\mathsf{PA} (Peano Arithmetic). We will see the proof outline of the model-theoretic proof of conservativity of the truth theory known as CT[PA]\mathsf{CT^-[PA]} (an extension of PA\mathsf{PA} 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 CT[PA]\mathsf{CT^-[PA]} in PA\mathsf{PA}, and the feasible proof-theoretic reducibility of CT[PA]\mathsf{CT^-[PA]} to PA\mathsf{PA}.

The second lecture concerns the ‘many faces theorem’ of the canonical extension CT0[PA]\mathsf{CT_{0}[PA]} of CT[PA]\mathsf{CT^-[PA]}, which includes a modicum of induction, namely Δ0\Delta_0-induction for formulae involving the truth predicate. This theorem suggests that CT0[PA]\mathsf{CT_{0}[PA]} is the weakest theory among ‘natural’ nonconservative extensions of CT[PA]\mathsf{CT^-[PA]}. We will also explore the intimate relationship between CT0[PA]\mathsf{CT_{0}[PA]} and a well-known strengthening of the fragment ACA0\mathsf{ACA_{0}} of second order arithmetic.

The focus of the third lecture is on truth theories over ZF\mathsf{ZF} (Zermelo–Fraenkel set theory). We will first go through some old and new conservativity results concerning CT[ZF]\mathsf{CT^-[ZF]}, and will then we examine certain nonconservative extensions of CT[ZF]\mathsf{CT^-[ZF]} that emerge from the search for the set-theoretical counterpart of CT0[PA]\mathsf{CT_{0}[PA]}.

Slides for Lecture 1-3. (Including an additional Preamble containing learning resources.)

Download the abstract.

 Overview  Program