Switch to: References

Add citations

You must login to add citations.
  1. Model Theory and Proof Theory of the Global Reflection Principle.Mateusz Zbigniew Łełyk - forthcoming - Journal of Symbolic Logic:1-42.
    The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion “All theorems of $\mathrm {Th}$ are true,” where $\mathrm {Th}$ is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kotlarski’s proof from [15], showing that the Global Reflection Principle for Peano Arithmetic is provable in the theory of compositional truth with bounded induction only (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Full Satisfaction Classes, Definability, and Automorphisms.Bartosz Wcisło - 2022 - Notre Dame Journal of Formal Logic 63 (2).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • An addition to Rosser's theorem.Henryk Kotlarski - 1996 - Journal of Symbolic Logic 61 (1):285-292.
    For a primitive recursive consistent and strong enough theory T we construct an independent statement which has some clear metamathematical meaning.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Local collection and end-extensions of models of compositional truth.Mateusz Łełyk & Bartosz Wcisło - 2021 - Annals of Pure and Applied Logic 172 (6):102941.
    We introduce a principle of local collection for compositional truth predicates and show that it is arithmetically conservative over the classically compositional theory of truth. This axiom states that upon restriction to formulae of any syntactic complexity, the resulting predicate satisfies full collection. In particular, arguments using collection for the truth predicate applied to sentences occurring in any given (code of a) proof do not suffice to show that the conclusion of that proof is true, in stark contrast to the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Models of weak theories of truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5-6):453-474.
    In the following paper we propose a model-theoretical way of comparing the “strength” of various truth theories which are conservative over PA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ PA $$\end{document}. Let Th\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak {Th}}$$\end{document} denote the class of models of PA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ PA $$\end{document} which admit an expansion to a model of theory Th\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Condensable models of set theory.Ali Enayat - 2022 - Archive for Mathematical Logic 61 (3):299-315.
    A model \ of ZF is said to be condensable if \\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}\) for some “ordinal” \, where \:=,\in )^{{\mathcal {M}}}\) and \ is the set of formulae of the infinitary logic \ that appear in the well-founded part of \. The work of Barwise and Schlipf in the 1970s revealed the fact that every countable recursively saturated model of ZF is cofinally condensable \prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \). Moreover, it (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Models of PT- with Internal Induction for Total Formulae.Cezary Cieslinski, Bartosz Wcisło & Mateusz Łełyk - 2017 - Review of Symbolic Logic 10 (1):187-202.
    We show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PT tot ) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to models of PT tot 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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Neutrally expandable models of arithmetic.Athar Abdul‐Quader & Roman Kossak - 2019 - Mathematical Logic Quarterly 65 (2):212-217.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In Kentaro Fujimoto, José Martínez Fernández, Henri Galinon & Theodora Achourioti (eds.), Unifying the Philosophy of Truth. Springer Verlag. pp. 339-354.
    In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation