Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • 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  
  • 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  
  • 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  
  • Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • A simplification of a completeness proof of Guaspari and Solovay.Dick H. J. Jongh - 1987 - Studia Logica 46 (2):187 - 192.
    The modal completeness proofs of Guaspari and Solovay (1979) for their systems R and R – are improved and the relationship between R and R – is clarified.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Rosser sentences.D. Guaspari - 1979 - Annals of Mathematical Logic 16 (1):81.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • A Simplification of a Completeness Proof of Guaspari and Solovay.Dick H. J. de Jongh - 1987 - Studia Logica 46 (2):187-192.
    The modal completeness proofs of Guaspari and Solovay for their systems R and R⁻ are improved and the relationship between R and R⁻ is clarified.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On the nonexistence of certain normal forms in the logic of provability.George Boolos - 1982 - Journal of Symbolic Logic 47 (3):638-640.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Extremely undecidable sentences.George Boolos - 1982 - Journal of Symbolic Logic 47 (1):191-196.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • The fixed-point theorem for diagonalizable algebras.Claudio Bernardi - 1975 - Studia Logica 34 (3):239 - 251.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Self-Reference and Modal Logic.[author unknown] - 1987 - Studia Logica 46 (4):395-398.
    Download  
     
    Export citation  
     
    Bookmark   59 citations