Switch to: References

Add citations

You must login to add citations.
  1. Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations.Christopher Hampson, Stanislav Kikot, Agi Kurucz & Sérgio Marcelino - 2020 - Annals of Pure and Applied Logic 171 (5):102786.
    Our concern is the axiomatisation problem for modal and algebraic logics that correspond to various fragments of two-variable first-order logic with counting quantifiers. In particular, we consider modal products with Diff, the propositional unimodal logic of the difference operator. We show that the two-dimensional product logic $Diff \times Diff$ is non-finitely axiomatisable, but can be axiomatised by infinitely many Sahlqvist axioms. We also show that its ‘square’ version (the modal counterpart of the substitution and equality free fragment of two-variable first-order (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The McKinsey–Lemmon logic is barely canonical.Robert Goldblatt & Ian Hodkinson - 2007 - Australasian Journal of Logic 5:1-19.
    We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of axioms generalising McKinsey’s formula. We prove that the class of all frames for this logic is not closed under elementary equivalence, and so is non-elementary. We also show that any axiomatisation of the logic involves infinitely many non-canonical formulas.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Hybrid Logic of the Hide and Seek Game.Katsuhiko Sano, Fenrong Liu & Dazhu Li - forthcoming - Studia Logica:1-33.
    The logic of the hide and seek game $$\textbf{LHS}$$ was proposed to capture interactions between agents in pursuit-evasion environments. In this paper, we explore a hybrid extension of $$\textbf{LHS}$$ and show that such an extension is beneficial in several aspects. We will show that it improves the technical properties of the resulting logical system, and expands the potential applications of the system. Specifically, we will investigate the expressive power of the hybrid logic of the hide and seek game $${\mathcal {H}}(\textbf{LHS})$$ (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An extension of Kracht's theorem to generalized Sahlqvist formulas.Stanislav Kikot - 2009 - Journal of Applied Non-Classical Logics 19 (2):227-251.
    Sahlqvist formulas are a syntactically specified class of modal formulas proposed by Hendrik Sahlqvist in 1975. They are important because of their first-order definability and canonicity, and hence axiomatize complete modal logics. The first-order properties definable by Sahlqvist formulas were syntactically characterized by Marcus Kracht in 1993. The present paper extends Kracht's theorem to the class of ‘generalized Sahlqvist formulas' introduced by Goranko and Vakarelov and describes an appropriate generalization of Kracht formulas.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Dichotomy for Some Elementarily Generated Modal Logics.Stanislav Kikot - 2015 - Studia Logica 103 (5):1063-1093.
    In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form \. We prove that many properties of these logics, such as finite axiomatisability, elementarity, axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula, together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • The bounded fragment and hybrid logic with polyadic modalities.Ian Hodkinson - 2010 - Review of Symbolic Logic 3 (2):279-286.
    We show that the bounded fragment of first-order logic and the hybrid language with and operators are equally expressive even with polyadic modalities, but that their fragments are equally expressive only for unary modalities.
    Download  
     
    Export citation  
     
    Bookmark