Switch to: References

Add citations

You must login to add citations.
  1. Simulation and transfer results in modal logic – a survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
    This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • An undecidable problem in correspondence theory.L. A. Chagrova - 1991 - Journal of Symbolic Logic 56 (4):1261-1272.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
    The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.
    Download  
     
    Export citation  
     
    Bookmark   1 citation