Switch to: References

Add citations

You must login to add citations.
  1. The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.Albert Visser - 1984 - Journal of Philosophical Logic 13 (1):97 - 113.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • On explicating the concept the power of an arithmetical theory.Jörgen Sjögren - 2008 - Journal of Philosophical Logic 37 (2):183 - 202.
    In this paper I discuss possible ways of measuring the power of arithmetical theories, and the possiblity of making an explication in Carnap's sense of this concept. Chaitin formulates several suggestions how to construct measures, and these suggestions are reviewed together with some new and old critical arguments. I also briefly review a measure I have designed together with some shortcomings of this measure. The conclusion of the paper is that it is not possible to formulate an explication of the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The modal logic of provability. The sequential approach.Giovanni Sambin & Silvio Valentini - 1982 - Journal of Philosophical Logic 11 (3):311 - 342.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • A completeness result for fixed‐point algebras.Franco Montagna - 1984 - Mathematical Logic Quarterly 30 (32‐34):525-532.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generic generalized Rosser fixed points.Dick H. J. Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193 - 203.
    To the standard propositional modal system of provability logic constants are added to account for the arithmetical fixed points introduced by Bernardi-Montagna in [5]. With that interpretation in mind, a system LR of modal propositional logic is axiomatized, a modal completeness theorem is established for LR and, after that, a uniform arithmetical (Solovay-type) completeness theorem with respect to PA is obtained for LR.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On arithmetical completeness of the logic of proofs.Sohei Iwata & Taishi Kurahashi - 2019 - Annals of Pure and Applied Logic 170 (2):163-179.
    Download  
     
    Export citation  
     
    Bookmark  
  • Generic Generalized Rosser Fixed Points.Dick H. J. de Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193-203.
    To the standard propositional modal system of provability logic constants are added to account for the arithmetical fixed points introduced by Bernardi-Montagna in [5]. With that interpretation in mind, a system LR of modal propositional logic is axiomatized, a modal completeness theorem is established for LR and, after that, a uniform arithmetical completeness theorem with respect to PA is obtained for LR.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Provability, truth, and modal logic.George Boolos - 1980 - Journal of Philosophical Logic 9 (1):1 - 7.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • History and Philosophy of Constructive Type Theory.Giovanni Sommaruga - 2000 - Dordrecht, Netherland: Springer.
    A comprehensive survey of Martin-Löf's constructive type theory, considerable parts of which have only been presented by Martin-Löf in lecture form or as part of conference talks. Sommaruga surveys the prehistory of type theory and its highly complex development through eight different stages from 1970 to 1995. He also provides a systematic presentation of the latest version of the theory, as offered by Martin-Löf at Leiden University in Fall 1993. This presentation gives a fuller and updated account of the system. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations