Switch to: References

Add citations

You must login to add citations.
  1. Gödel’s Theorem and Direct Self-Reference.Saul A. Kripke - forthcoming - Review of Symbolic Logic:1-5.
    In his paper on the incompleteness theorems, Gödel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that ‘direct’ self-reference can actually be used to prove his result.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Alethic Reference.Lavinia Picollo - 2020 - Journal of Philosophical Logic 49 (3):417-438.
    I put forward precise and appealing notions of reference, self-reference, and well-foundedness for sentences of the language of first-order Peano arithmetic extended with a truth predicate. These notions are intended to play a central role in the study of the reference patterns that underlie expressions leading to semantic paradox and, thus, in the construction of philosophically well-motivated semantic theories of truth.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • Reference and Truth.Lavinia Picollo - 2020 - Journal of Philosophical Logic 49 (3):439-474.
    I apply the notions of alethic reference introduced in previous work in the construction of several classical semantic truth theories. Furthermore, I provide proof-theoretic versions of those notions and use them to formulate axiomatic disquotational truth systems over classical logic. Some of these systems are shown to be sound, proof-theoretically strong, and compare well to the most renowned systems in the literature.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  • Self-Reference Upfront: A Study of Self-Referential Gödel Numberings.Balthasar Grabmayr & Albert Visser - forthcoming - Review of Symbolic Logic:1-40.
    In this paper we examine various requirements on the formalisation choices under which self-reference can be adequately formalised in arithmetic. In particular, we study self-referential numberings, which immediately provide a strong notion of self-reference even for expressively weak languages. The results of this paper suggest that the question whether truly self-referential reasoning can be formalised in arithmetic is more sensitive to the underlying coding apparatus than usually believed. As a case study, we show how this sensitivity affects the formal study (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Recovery Operator for Nontransitive Approaches.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Review of Symbolic Logic 13 (1):80-104.
    In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations