Author:
KOSSAK ROMAN,WCISŁO BARTOSZ
Abstract
AbstractWe introduce a tool for analysing models of
$\text {CT}^-$
, the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan’s theorem that the arithmetical part of models of
$\text {CT}^-$
are recursively saturated. We also use this tool to provide a new proof of theorem from [8] that all models of
$\text {CT}^-$
carry a partial inductive truth predicate. Finally, we construct a partial truth predicate defined for a set of formulae whose syntactic depth forms a nonstandard cut which cannot be extended to a full truth predicate satisfying
$\text {CT}^-$
.
Publisher
Cambridge University Press (CUP)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献