RECORD
Truth, Disjunction, and Induction
Logic · Submitted 24 May 2018
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Our main result shows that conservativity fails even for the extension of $CT^{-}[PA]$ obtained by the seemingly weak axiom of disjunctive correctness $DC$ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
By a well-known result of Kotlarski, Krajewski, and Lachlan (1981), first-order Peano arithmetic $PA$ can be conservatively extended to the theory $CT^{-}[PA]$ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. This results motivates the general question of determining natural axioms concerning the truth predicate that can be added to $CT^{-}[PA]$ while maintaining conservativity over $PA$. Our main result shows that conservativity fails even for the extension of $CT^{-}[PA]$ obtained by the seemingly weak axiom of disjunctive correctness $DC$ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. In particular, $CT^{-}[PA] + DC$ implies $Con(PA)$. Our main result states that the theory $CT^{-}[PA] + DC$ coincides with the theory $CT_0[PA]$ obtained by adding $\Delta_0$-induction in the language with the truth predicate. This result strengthens earlier work by Kotlarski (1986) and Cie\'sli\'nski (2010). For our proof we develop a new general form of Visser's theorem on non-existence of infinite descending chains of truth definitions and prove it by reduction to (L\"ob's version of) G\"odel's second incompleteness theorem, rather than by using the Visser-Yablo paradox, as in Visser's original proof (1989).
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | By a well-known result of Kotlarski, Krajewski, and Lachlan (1981), first-order Peano arithmetic $PA$ can be conservatively extended to the theory $CT^{-}[PA]$ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. | background 1.00 | 0.02 | 0.02 | asserted 1.00 |
| s1 | This results motivates the general question of determining natural axioms concerning the truth predicate that can be added to $CT^{-}[PA]$ while maintaining conservativity over $PA$. | background 0.85 | 0.06 | 0.02 | asserted 0.71 |
| s2 | Our main result shows that conservativity fails even for the extension of $CT^{-}[PA]$ obtained by the seemingly weak axiom of disjunctive correctness $DC$ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. | result 0.98 | 0.93 | 0.83 | asserted 1.00 |
| s3 | In particular, $CT^{-}[PA] + DC$ implies $Con(PA)$. | result 0.97 | 0.88 | 0.35 | asserted 1.00 |
| s4 | Our main result states that the theory $CT^{-}[PA] + DC$ coincides with the theory $CT_0[PA]$ obtained by adding $\Delta_0$-induction in the language with the truth predicate. | result 1.00 | 0.94 | 0.69 | asserted 1.00 |
| s5 | This result strengthens earlier work by Kotlarski (1986) and Cie\'sli\'nski (2010). | interpretation 0.33 | 0.30 | 0.03 | asserted 1.00 |
| s6 | For our proof we develop a new general form of Visser's theorem on non-existence of infinite descending chains of truth definitions and prove it by reduction to (L\"ob's version of) G\"odel's second incompleteness theorem, rather than by using the Visser-Yablo paradox, as in Visser's original proof (1989). | method 0.97 | 0.93 | 0.02 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
By a well-known result of Kotlarski, Krajewski, and Lachlan (1981), first-order Peano arithmetic $PA$ can be conservatively extended to the theory $CT^{-}[PA]$ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. This results motivates the general question of determining natural axioms concerning the truth predicate that can be added to $CT^{-}[PA]$ while maintaining conservativity over $PA$. Our main result shows that conservativity fails even for the extension of $CT^{-}[PA]$ obtained by the seemingly weak axiom of disjunctive correctness $DC$ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. In particular, $CT^{-}[PA] + DC$ implies $Con(PA)$. Our main result states that the theory $CT^{-}[PA] + DC$ coincides with the theory $CT_0[PA]$ obtained by adding $\Delta_0$-induction in the language with the truth predicate. This result strengthens earlier work by Kotlarski (1986) and Cie\'sli\'nski (2010). For our proof we develop a new general form of Visser's theorem on non-existence of infinite descending chains of truth definitions and prove it by reduction to (L\"ob's version of) G\"odel's second incompleteness theorem, rather than by using the Visser-Yablo paradox, as in Visser's original proof (1989).
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.