Switch to: References

Add citations

You must login to add citations.
  1. On Finite Model Property for Admissible Rules.Vladimir V. Rybakov, Vladimir R. Kiyatkin & Tahsin Oner - 1999 - Mathematical Logic Quarterly 45 (4):505-520.
    Our investigation is concerned with the finite model property with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  • From Intuitionism to Brouwer's Modal Logic.Zofia Kostrzycka - 2020 - Bulletin of the Section of Logic 49 (4):343-358.
    We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication, whereas variables and other positive sentences remain as they are. The proposed translation preserves fragments of the Rieger-Nishimura lattice which is the Lindenbaum algebra of monadic formulas in INT. Unfortunately, INT is not embedded by this mapping into KTB.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Canonical Formulas for K4. Part III: The Finite Model Property.Michael Zakharyaschev - 1997 - Journal of Symbolic Logic 62 (3):950-975.
    Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4 , 1377--1402. Project Euclid: euclid.jsl/1183744119 Part II: Michael Zakharyaschev. Canonical Formulas for K4. Part II: Cofinal Subframe Logics. J. Symbolic Logic, Volume 61, Issue 2 , 421--449. Project Euclid: euclid.jsl/1183745008.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Completeness and Decidability of Tense Logics Closely Related to Logics Above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
    Tense logics formulated in the bimodal propositional language are investigated with respect to Kripke-completeness (completeness) and decidability. It is proved that all minimal tense extensions of modal logics of finite width (in the sense of K. Kine) as well as all minimal tense extensions of cofinal subframe logics (in the sense of M. Zakharyaschev) are complete. The decidability of all finitely axiomatizable minimal tense extensions of cofinal subframe logics is shown. A number of variations and extensions of these results are (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations