Switch to: References

Add citations

You must login to add citations.
  1. On modal logics between {$\roman K\times\roman K\times \roman K$} and {${\rm S}5\times{\rm S}5\times{\rm S}5$}.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
    We prove that everyn-modal logic betweenKnandS5nis undecidable, whenever n ≥ 3. We also show that each of these logics is non-finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov–Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a reduction of the representation problem of finite relation (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • On modal logics between K × K × K and s5 × s5 × S.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
    We prove that everyn-modal logic betweenKnandS5nis undecidable, whenever n ≥ 3. We also show that each of these logics is non-finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov–Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a reduction of the representation problem of finite relation (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations