Author:
CIEŚLIŃSKI CEZARY,ŁEŁYK MATEUSZ,WCISŁO BARTOSZ
Abstract
AbstractWe show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PTtot) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to models of PTtot contains every recursively saturated model of arithmetic. Our results point to a gap in the philosophical project of describing the use of the truth predicate in model-theoretic contexts.
Publisher
Cambridge University Press (CUP)
Subject
Logic,Philosophy,Mathematics (miscellaneous)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DISJUNCTIONS WITH STOPPING CONDITIONS;The Bulletin of Symbolic Logic;2021-01-05
2. TRUTH AND FEASIBLE REDUCIBILITY;The Journal of Symbolic Logic;2019-09-20
3. MODELS OF POSITIVE TRUTH;The Review of Symbolic Logic;2018-12-26
4. Truth and the Philosophy of Mathematics;Boston Studies in the Philosophy and History of Science;2012-02-24