Switch to: References

Add citations

You must login to add citations.
  1. Self-Reference in Arithmetic II.Volker Halbach & Albert Visser - 2014 - Review of Symbolic Logic 7 (4):692-712.
    In this sequel toSelf-reference in arithmetic Iwe continue our discussion of the question: What does it mean for a sentence of arithmetic to ascribe to itself a property? We investigate how the properties of the supposedly self-referential sentences depend on the chosen coding, the formulae expressing the properties and the way a fixed point for the expressing formulae are obtained. In this second part we look at some further examples. In particular, we study sentences apparently expressing their Rosser-provability, their own${\rm{\Sigma (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Gödel’s Second Incompleteness Theorem: How It is Derived and What It Delivers.Saeed Salehi - 2020 - Bulletin of Symbolic Logic 26 (3-4):241-256.
    The proofs of Gödel (1931), Rosser (1936), Kleene (first 1936 and second 1950), Chaitin (1970), and Boolos (1989) for the first incompleteness theorem are compared with each other, especially from the viewpoint of the second incompleteness theorem. It is shown that Gödel’s (first incompleteness theorem) and Kleene’s first theorems are equivalent with the second incompleteness theorem, Rosser’s and Kleene’s second theorems do deliver the second incompleteness theorem, and Boolos’ theorem is derived from the second incompleteness theorem in the standard way. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Rosser-Type Undecidable Sentences Based on Yablo’s Paradox.Taishi Kurahashi - 2014 - Journal of Philosophical Logic 43 (5):999-1017.
    It is widely considered that Gödel’s and Rosser’s proofs of the incompleteness theorems are related to the Liar Paradox. Yablo’s paradox, a Liar-like paradox without self-reference, can also be used to prove Gödel’s first and second incompleteness theorems. We show that the situation with the formalization of Yablo’s paradox using Rosser’s provability predicate is different from that of Rosser’s proof. Namely, by using the technique of Guaspari and Solovay, we prove that the undecidability of each instance of Rosser-type formalizations of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Note on Derivability Conditions.Taishi Kurahashi - 2020 - Journal of Symbolic Logic 85 (3):1224-1253.
    We investigate relationships between versions of derivability conditions for provability predicates. We show several implications and non-implications between the conditions, and we discuss unprovability of consistency statements induced by derivability conditions. First, we classify already known versions of the second incompleteness theorem, and exhibit some new sets of conditions which are sufficient for unprovability of Hilbert–Bernays’ consistency statement. Secondly, we improve Buchholz’s schematic proof of provable$\Sigma_1$-completeness. Then among other things, we show that Hilbert–Bernays’ conditions and Löb’s conditions are mutually incomparable. (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations