Classical determinate truth without induction

Abstract

Fujimoto and Halbach had introduced a novel theory of type-free truth CD which satisfies full classical compositional clauses for connectives and quantifiers. Answering their question, we show that the induction-free variant of that theory is conservative over Peano Arithmetic.

arXiv comment24 pages