Switch to: References

Add citations

You must login to add citations.
  1. Models of Positive Truth.Mateusz Łełyk & Bartosz Wcisło - 2019 - Review of Symbolic Logic 12 (1):144-172.
    This paper is a follow-up to [4], in which a mistake in [6] (which spread also to [9]) was corrected. We give a strenghtening of the main result on the semantical nonconservativity of the theory of PT−with internal induction for total formulae${(\rm{P}}{{\rm{T}}^ - } + {\rm{INT}}\left( {{\rm{tot}}} \right)$, denoted by PT−in [9]). We show that if to PT−the axiom of internal induction forallarithmetical formulae is added (giving${\rm{P}}{{\rm{T}}^ - } + {\rm{INT}}$), then this theory is semantically stronger than${\rm{P}}{{\rm{T}}^ - } + (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Disjunctions with stopping conditions.Roman Kossak & Bartosz Wcisło - 2021 - Bulletin of Symbolic Logic 27 (3):231-253.
    We 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations