Classical determinate truth without induction
Logic
2024-08-05 v1
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.
Cite
@article{arxiv.2408.01198,
title = {Classical determinate truth without induction},
author = {Bartosz Wcisło},
journal= {arXiv preprint arXiv:2408.01198},
year = {2024}
}
Comments
24 pages