Switch to: Citations

Add references

You must login to add references.
  1. The unprovability of consistency: an essay in modal logic.George Boolos - 1979 - New York: Cambridge University Press.
    The Unprovability of Consistency is concerned with connections between two branches of logic: proof theory and modal logic. Modal logic is the study of the principles that govern the concepts of necessity and possibility; proof theory is, in part, the study of those that govern provability and consistency. In this book, George Boolos looks at the principles of provability from the standpoint of modal logic. In doing so, he provides two perspectives on a debate in modal logic that has persisted (...)
    Download  
     
    Export citation  
     
    Bookmark   67 citations  
  • (2 other versions)The Unprovability of Consistency. An Essay in Modal Logic.C. Smoryński - 1979 - Journal of Symbolic Logic 46 (4):871-873.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • A modal sequent calculus for a fragment of arithmetic.G. Sambin & S. Valentini - 1980 - Studia Logica 39 (2-3):245-256.
    Global properties of canonical derivability predicates in Peano Arithmetic) are studied here by means of a suitable propositional modal logic GL. A whole book [1] has appeared on GL and we refer to it for more information and a bibliography on GL. Here we propose a sequent calculus for GL and, by exhibiting a good proof procedure, prove that such calculus admits the elimination of cuts. Most of standard results on GL are then easy consequences: completeness, decidability, finite model property, (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • The uniqueness of the fixed-point in every diagonalizable algebra.Claudio Bernardi - 1976 - Studia Logica 35 (4):335 - 343.
    It is well known that, in Peano arithmetic, there exists a formula Theor (x) which numerates the set of theorems. By Gödel's and Löb's results, we have that Theor (˹p˺) ≡ p implies p is a theorem ∼Theor (˹p˺) ≡ p implies p is provably equivalent to Theor (˹0 = 1˺). Therefore, the considered "equations" admit, up to provable equivalence, only one solution. In this paper we prove (Corollary 1) that, in general, if P (x) is an arbitrary formula built (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • An effective fixed-point theorem in intuitionistic diagonalizable algebras.Giovanni Sambin - 1976 - Studia Logica 35 (4):345 - 361.
    Within the technical frame supplied by the algebraic variety of diagonalizable algebras, defined by R. Magari in [2], we prove the following: Let T be any first-order theory with a predicate Pr satisfying the canonical derivability conditions, including Löb's property. Then any formula in T built up from the propositional variables $q,p_{1},...,p_{n}$ , using logical connectives and the predicate Pr, has the same "fixed-points" relative to q (that is, formulas $\psi (p_{1},...,p_{n})$ for which for all $p_{1},...,p_{n}\vdash _{T}\phi (\psi (p_{1},...,p_{n}),p_{1},...,p_{n})\leftrightarrow \psi (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Extremely undecidable sentences.George Boolos - 1982 - Journal of Symbolic Logic 47 (1):191-196.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Provability Interpretations of Modal Logic.Robert M. Solovay - 1981 - Journal of Symbolic Logic 46 (3):661-662.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • The modal logic of provability: Cut-elimination. [REVIEW]Silvio Valentini - 1983 - Journal of Philosophical Logic 12 (4):471 - 476.
    Download  
     
    Export citation  
     
    Bookmark   23 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   114 citations  
  • On the proof theory of the modal logic for arithmetic provability.Daniel Leivant - 1981 - Journal of Symbolic Logic 46 (3):531-538.
    Download  
     
    Export citation  
     
    Bookmark   15 citations