Switch to: References

Add citations

You must login to add citations.
  1. Uniform Lyndon interpolation property in propositional modal logics.Taishi Kurahashi - 2020 - Archive for Mathematical Logic 59 (5):659-678.
    We introduce and investigate the notion of uniform Lyndon interpolation property which is a strengthening of both uniform interpolation property and Lyndon interpolation property. We prove several propositional modal logics including \, \, \ and \ enjoy ULIP. Our proofs are modifications of Visser’s proofs of uniform interpolation property using layered bisimulations Gödel’96, logical foundations of mathematics, computer science and physics—Kurt Gödel’s legacy, Springer, Berlin, 1996). Also we give a new upper bound on the complexity of uniform interpolants for \ (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Algorithmic Correspondence and Completeness in Modal Logic. IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some Modal Aspects of XPath.Balder ten Cate, Gaëlle Fontaine & Tadeusz Litak - 2010 - Journal of Applied Non-Classical Logics 20 (3):139-171.
    This paper provides several examples of how modal logic can be used in studying the XML document navigation language XPath. More specifically, we derive complete axiomatizations, computational complexity and expressive power results for XPath fragments from known results for corresponding logics. A secondary aim of the paper is to introduce XPath in a way that makes it accessible to an audience of modal logicians.
    Download  
     
    Export citation  
     
    Bookmark  
  • Continuity, Freeness, and Filtrations.Silvio Ghilardi - 2010 - Journal of Applied Non-Classical Logics 20 (3):193-217.
    The role played by continuous morphisms in propositional modal logic is investigated: it turns out that they are strictly related to filtrations and to suitable variants of the notion of a free algebra. We also employ continuous morphisms in incremental constructions of finitely generated free.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Finite Models Constructed From Canonical Formulas.Lawrence S. Moss - 2007 - Journal of Philosophical Logic 36 (6):605 - 640.
    This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is to (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Undefinability of Propositional Quantifiers in the Modal System S.Silvio Ghilardi & Marek Zawadowski - 1995 - Studia Logica 55 (2):259 - 271.
    We show that (contrary to the parallel case of intuitionistic logic, see [7], [4]) there does not exist a translation fromS42 (the propositional modal systemS4 enriched with propositional quantifiers) intoS4 that preserves provability and reduces to identity for Boolean connectives and.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Complete Additivity and Modal Incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
    In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • A Sheaf Representation and Duality for Finitely Presented Heyting Algebras.Silvio Ghilardi & Marek Zawadowski - 1995 - Journal of Symbolic Logic 60 (3):911-939.
    A. M. Pitts in [Pi] proved that HA op fp is a bi-Heyting category satisfying the Lawrence condition. We show that the embedding $\Phi: HA^\mathrm{op}_\mathrm{fp} \longrightarrow Sh(\mathbf{P_0,J_0})$ into the topos of sheaves, (P 0 is the category of finite rooted posets and open maps, J 0 the canonical topology on P 0 ) given by $H \longmapsto HA(H,\mathscr{D}(-)): \mathbf{P_0} \longrightarrow \text{Set}$ preserves the structure mentioned above, finite coproducts, and subobject classifier, it is also conservative. This whole structure on HA op (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Formulas in Modal Logic S4.Katsumi Sasaki - 2010 - Review of Symbolic Logic 3 (4):600-627.
    Here, we provide a detailed description of the mutual relation of formulas with finite propositional variables p1, …, pm in modal logic S4. Our description contains more information on S4 than those given in Shehtman (1978) and Moss (2007); however, Shehtman (1978) also treated Grzegorczyk logic and Moss (2007) treated many other normal modal logics. Specifically, we construct normal forms, which behave like the principal conjunctive normal forms in the classical propositional logic. The results include finite and effective methods to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Bounded Proof Property Via Step Algebras and Step Frames.Nick Bezhanishvili & Silvio Ghilardi - 2014 - Annals of Pure and Applied Logic 165 (12):1832-1863.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Approximations of Modal Logics: And Beyond.Guilherme de Souza Rabello & Marcelo Finger - 2008 - Annals of Pure and Applied Logic 152 (1):161-173.
    Inspired by the recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of the n-degree of introspection that is allowed, thus generating modaln-logics. The semantics for n-logics is presented, in which formulas are evaluated with respect to paths, and not possible worlds. A tableau-based proof system is presented, n-SST, and soundness and completeness is shown for the approximation of modal logics image and image.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Decidability and Complexity of Fibred Logics Without Shared Connectives.Sérgio Marcelino & Carlos Caleiro - 2016 - Logic Journal of the IGPL 24 (5).
    Download  
     
    Export citation  
     
    Bookmark   1 citation