Switch to: Citations

Add references

You must login to add references.
  1. Deflationary Truth and Pathologies.Cezary Cieśliński - 2010 - Journal of Philosophical Logic 39 (3):325-337.
    By a classical result of Kotlarski, Krajewski and Lachlan, pathological satisfaction classes can be constructed for countable, recursively saturated models of Peano arithmetic. In this paper we consider the question of whether the pathology can be eliminated; we ask in effect what generalities involving the notion of truth can be obtained in a deflationary truth theory (a theory of truth which is conservative over its base). It is shown that the answer depends on the notion of pathology we adopt. It (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 1974 - Cambridge, England: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • New Constructions of Satisfaction Classes.Albert Visser & Ali Enayat - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Notes on bounded induction for the compositional truth predicate.Bartosz Wcisło & Mateusz Łełyk - 2017 - Review of Symbolic Logic 10 (3):455-480.
    We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with \Delta 0 -induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano Arithmetic. In addition, we show that a slightly modified theory of truth actually proves the global reflection principle over the base theory.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reflection ranks and ordinal analysis.Fedor Pakhomov & James Walsh - 2021 - Journal of Symbolic Logic 86 (4):1350-1384.
    It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the$\Pi ^1_1$reflection strength order. We prove that there are no descending sequences of$\Pi ^1_1$sound extensions of$\mathsf {ACA}_0$in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any$\Pi (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Solution of a problem of Leon Henkin.M. H. Löb - 1955 - Journal of Symbolic Logic 20 (2):115-118.
    Download  
     
    Export citation  
     
    Bookmark   108 citations  
  • Conservativity for theories of compositional truth via cut elimination.Graham E. Leigh - 2015 - Journal of Symbolic Logic 80 (3):845-865.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Bounded Induction and Satisfaction Classes.Henryk Kotlarski - 1986 - Mathematical Logic Quarterly 32 (31-34):531-544.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • From hierarchies to well-foundedness.Dandolo Flumini & Kentaro Sato - 2014 - Archive for Mathematical Logic 53 (7-8):855-863.
    We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies have been extensively studied, we point out that well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting α⊢wfwhereα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${_\alpha \vdash \mathsf{wf}\, {\rm where}\, _\alpha}$$\end{document} stands for the iteration of Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
    An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Axiomatic theories of truth.Volker Halbach - 2008 - Stanford Encyclopedia of Philosophy.
    Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic -- Deflationism (...)
    Download  
     
    Export citation  
     
    Bookmark   116 citations  
  • Construction of Satisfaction Classes for Nonstandard Models.Henryk Kotlarski, Stanislav Krajewski & Alistair H. Lachlan - 1981 - Canadian Mathematical Bulletin 24 (1):283--93.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Semantics and the liar paradox.Albert Visser - 1989 - Handbook of Philosophical Logic 4 (1):617--706.
    Download  
     
    Export citation  
     
    Bookmark   62 citations  
  • Chapter 1: An introduction to proof theory & Chapter 2: Firstorder proof theory of arithmetic.S. Buss - 1998 - In Samuel R. Buss (ed.), Handbook of Proof Theory. Elsevier.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
    Download  
     
    Export citation  
     
    Bookmark   150 citations  
  • Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
    Download  
     
    Export citation  
     
    Bookmark   135 citations  
  • Metamathematics of First-Order Arithmetic.P. Hájek & P. Pudlák - 2000 - Studia Logica 64 (3):429-430.
    Download  
     
    Export citation  
     
    Bookmark   80 citations