Switch to: References

Add citations

You must login to add citations.
  1. On the set of 'meaningful' sentences of arithmetic.Aldo Ursini - 1978 - Studia Logica 37 (3):237 - 241.
    I give several characterizations of the set V₀ proposed in [3] as the set of meaningful and true sentences of first order arthimetic, and show that in Peano arithmetic the Σ₂ completeness of V₀ is provable.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logic of paradox revisited.Graham Priest - 1984 - Journal of Philosophical Logic 13 (2):153 - 179.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • Provability logics for natural Turing progressions of arithmetical theories.L. D. Beklemishev - 1991 - Studia Logica 50 (1):107 - 128.
    Provability logics with many modal operators for progressions of theories obtained by iterating their consistency statements are introduced. The corresponding arithmetical completeness theorem is proved.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • On the set of ‘Meaningful’ sentences of arithmetic.Aldo Ursini - 1978 - Studia Logica 37 (3):237-241.
    I give several characterizations of the set V₀ proposed in [3] as the set of meaningful and true sentences of first order arthimetic, and show that in Peano arithmetic the Σ₂ completeness of V₀ is provable.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-c4c498947-l59hv uwo