Compositional truth with propositional tautologies and quantifier-free correctness

DOI10.1007/S00153-023-00893-3MaRDI QIDQ6139242zbMATH OpenOpenAlexFDO

Authors Bartosz Wcisło

Publication date 18 January 2024

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2011.06940

zbMATH Keywords

\( \mathrm{CT}_0\)compositional truth conservativeness disjunctive correctness propositional soundness Tarski boundary

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Foundations of classical theories (including reverse mathematics) (03B30) Models of arithmetic and set theory (03C62) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Abstract: Cie'sli'nski asked whether compositional truth theory with the additional axiom that all propositional tautologies are true is conservative over Peano Arithmetic. We provide a partial answer to this question, showing that if we additionally assume that truth predicate agrees with arithmetical truth on quantifier-free sentences, the resulting theory is as strong as

D e l t a_{0}

-induction for the compositional truth predicate, hence non-conservative. On the other hand, it can be shown with a routine argument that the principle of quantifier-free correctness is itself conservative.

Review text

This is another in a series of papers by various authors on what has been dubbed by Ali Enayat the Tarski Boundary Problem. By the well-known theorem of Kotlarski, Krajewski and Lachlan, the theory \(\mathsf{CT}^-\), that extends Peano Arithmetic (\(\mathsf{PA}\)) by compositional axioms for a truth predicate, is conservative over \(\mathsf{PA}\). The theory \(\mathsf{CT}\) obtained by adding to \(\mathsf{CT}^-\) the induction schema for the full language with the truth predicate symbol \(T\) is not a not a conservative extension of \(\mathsf{PA}\), and so is \(\mathsf{CT}_0\), which is \(\mathsf{CT}\) with the induction axioms for formulas with \(T\) is restricted to bounded formulas. Many seemingly innocuous extensions of \(\mathsf{CT}^-\) are pushed into the nonconservative side and often those extensions turn out to be equivalent to \(\mathsf{CT}_0\). By a result of \textit{A. Enayat} and \textit{F. Pakhomov} from [Arch. Math. Logic 58, No. 5--6, 753--766 (2019; Zbl 1477.03250)], prominent among them is obtained by adding to \(\mathsf{CT}^-\) the principle of disjunctive correctness \(\mathsf{DC}\). The main result of Wcisło's paper paper adds to the list \(\mathsf{CT}^-\) extended by the propositional soundness principle \(\mathsf{PS}\) that states that any propositional tautology is true (according to the truth predicate). The proof is in two parts. It is first shown that \(\mathsf{CT}^-+\mathsf{PS}\) extended by the quantifier-free correctness principle \(\mathsf{QFC}\) is equivalent to \(\mathsf{CT}_0\), and to prove this Wcisło applies his own technique of disjunctions with stopping conditions. Then, \(\mathsf{QFC}\) is eliminated by showing that \(\mathsf{CT}^-+\mathsf{QFC}\) is conservative over \(\mathsf{PA}\). This second part uses a variant of the Enayat-Visser construction of satisfaction classes introduced in [\textit{A. Enayat} and \textit{A. Visser}, ``New constructions of satisfaction classes, Log. Epistemol. Unity Sci. 36, 321--335 (2015)]. Despite relaying on the results by Enayat and Pakhomov, and Enayat and Visser, the paper is self-contained and full proofs of the variants of these results are given in two appendices. The paper is very well written and it can serve as a good introduction to the Tarski boundary problem.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Compositional truth with propositional tautologies and quantifier-free correctness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139242)