Switch to: References

Add citations

You must login to add citations.
  1. Analogues of Bull’s theorem for hybrid logic.Willem Conradie & Claudette Robinson - 2019 - Logic Journal of the IGPL 27 (3):281-313.
    Download  
     
    Export citation  
     
    Bookmark  
  • Algorithmic correspondence and canonicity for distributive modal logic.Willem Conradie & Alessandra Palmigiano - 2012 - Annals of Pure and Applied Logic 163 (3):338-376.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Axiomatizing hybrid logic using modal logic.Ian Hodkinson & Louis Paternault - 2010 - Journal of Applied Logic 8 (4):386-396.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Axiomatizing hybrid products.Katsuhiko Sano - 2010 - Journal of Applied Logic 8 (4):459-474.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Sahlqvist Correspondence for Modal mu-calculus.Johan van Benthem, Nick Bezhanishvili & Ian Hodkinson - 2012 - Studia Logica 100 (1-2):31-60.
    We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
    We characterize the modal logics of elementary classes of Kripke frames as precisely those modal logics that are axiomatized by modal axioms synthesized in a certain effective way from "quasi-positive" sentences of hybrid logic. These are pure positive hybrid sentences with arbitrary existential and relativized universal quantification over nominals. The proof has three steps. The first step is to use the known result that the modal logic of any elementary class of Kripke frames is also the modal logic of the (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Sahlqvist Completeness Theory for Hybrid Logic with Downarrow Binder.Zhiguang Zhao - forthcoming - Logic Journal of the IGPL.
    In the present paper, we continue the research in Zhao (2021, Logic J. IGPL) to develop the Sahlqvist completeness theory for hybrid logic with satisfaction operators and downarrow binders |$\mathcal {L}( @, {\downarrow })$|⁠. We define the class of restricted Sahlqvist formulas for |$\mathcal {L}( @, {\downarrow })$| following the ideas in Conradie and Robinson (2017, J. Logic Comput., 27, 867–900), but we follow a different proof strategy which is purely proof-theoretic, namely showing that for every restricted Sahlqvist formula |$\varphi (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Algorithmic correspondence and canonicity for non-distributive logics.Willem Conradie & Alessandra Palmigiano - 2019 - Annals of Pure and Applied Logic 170 (9):923-974.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Sahlqvist Correspondence for Modal mu-calculus.Johan Benthem, Nick Bezhanishvili & Ian Hodkinson - 2012 - Studia Logica 100 (1-2):31-60.
    We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.
    Download  
     
    Export citation  
     
    Bookmark   4 citations