Kripke completeness of strictly positive modal logics over meet-semilattices with operators
DOI10.1017/JSL.2019.22zbMATH Open1444.03063arXiv1708.03403OpenAlexW3102684629WikidataQ128122692 ScholiaQ128122692MaRDI QIDQ5222523FDOQ5222523
Authors: Yoshihito Tanaka, F. Wolter, Stanislav Kikot, Agi Kurucz, Michael Zakharyaschev
Publication date: 6 April 2020
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.03403
Recommendations
computational complexitydescription logicdecidabilitymodal logicKripke completenessstrict implicationsemilattices with operatorsSLOsp-formulasp-implicationspi-logic
Cites Work
- Modal logic
- A topological representation theory for lattices
- Stone duality for lattices
- Model theory
- Kripke models for linear logic
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Title not available (Why is that?)
- Boolean Algebras with Operators. Part I
- A new semantics for positive modal logic
- Positive modal logic
- Natural dualities for semilattice-based algebras
- Handbook of modal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Varieties of complex algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounded distributive lattice expansions
- Title not available (Why is that?)
- Bounded lattice expansions
- Attributive concept descriptions with complements
- The algebra of topology
- Title not available (Why is that?)
- Constructive canonicity in non-classical logics
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Title not available (Why is that?)
- On the positive fragment of the polymodal provability logic GLP
- Positive provability logic for uniform reflection principles
- Calibrating provability logic: from modal logic to reflection calculus
- The complexity of existential quantification in concept languages.
- The truth about algorithmic problems in correspondence theory
- Title not available (Why is that?)
- Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
- A Sahlqvist theorem for distributive modal logic
- Locality and subsumption testing in \({\mathcal{EL}}\) and some of its extensions
- The undecidability of the disjunction property of propositional logics and other related problems
- Title not available (Why is that?)
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. I
- An ascending chain of S4 logics
- Monotone bounded distributive lattice expansions
- PSPACE-decidability of Japaridze's polymodal logic
- Title not available (Why is that?)
- Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
- Decidable elementary modal logics
- On the complexity of elementary modal logics
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. II
- An incomplete logic containing S4
- An incompleteness theorem in modal logic
- Mathematical Logic for Life Science Ontologies
- The complexity of poor man's logic
- On the reflection calculus with partial conservativity operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to description logic
- Stability of the Blok theorem
- Semilattices with closure
- Title not available (Why is that?)
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- A note on strictly positive logics and word rewriting systems
- Title not available (Why is that?)
- Filtration safe operations on frames
- Title not available (Why is that?)
Cited In (7)
- AN ESCAPE FROM VARDANYAN’S THEOREM
- Title not available (Why is that?)
- Monotonic modal logics with a conjunction
- Lambek calculus with conjugates
- On strictly positive modal logics with \textsf{S}4.3 frames
- A proof-theoretic approach to negative translations in intuitionistic tense logics
- Modal companions of \(K4^+\)
This page was built for publication: Kripke completeness of strictly positive modal logics over meet-semilattices with operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222523)