Truth, disjunction, and induction

Abstract: By a well-known result of Kotlarski, Krajewski, and Lachlan (1981), first-order Peano arithmetic

P A

can be conservatively extended to the theory

C T^{-} [P A]

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

C T^{-} [P A]

while maintaining conservativity over

P A

. Our main result shows that conservativity fails even for the extension of

C T^{-} [P A]

obtained by the seemingly weak axiom of disjunctive correctness

D C

that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. In particular,

C T^{-} [P A] + D C

implies

C o n (P A)

. Our main result states that the theory

C T^{-} [P A] + D C

coincides with the theory

C T_{0} [P A]

obtained by adding

D e l t a_{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).

Recommendations

Cites work

Cited in

(20)

This page was built for publication: Truth, disjunction, and induction

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