KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS
From MaRDI portal
Publication:5222523
DOI10.1017/jsl.2019.22zbMath1444.03063arXiv1708.03403OpenAlexW3102684629WikidataQ128122692 ScholiaQ128122692MaRDI QIDQ5222523
Yoshihito Tanaka, Frank Wolter, Stanislav Kikot, Michael Zakharyashchev, Agi Kurucz
Publication date: 6 April 2020
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.03403
computational complexitymodal logicdecidabilitydescription logicKripke completenessstrict implicationsemilattices with operatorsSLOsp-formulasp-implicationspi-logic
Related Items (5)
AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ Monotonic modal logics with a conjunction ⋮ Lambek calculus with conjugates ⋮ A proof-theoretic approach to negative translations in intuitionistic tense logics ⋮ Modal companions of \(K4^+\)
Cites Work
- Positive provability logic for uniform reflection principles
- A Sahlqvist theorem for distributive modal logic
- Attributive concept descriptions with complements
- The complexity of existential quantification in concept languages.
- Stability of the Blok theorem
- A topological representation theory for lattices
- Stone duality for lattices
- Constructive canonicity in non-classical logics
- A new semantics for positive modal logic
- Model theory
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- On the reflection calculus with partial conservativity operators
- Positive modal logic
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. I
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. II
- On the positive fragment of the polymodal provability logic GLP
- Natural dualities for semilattice-based algebras
- Semilattices with closure
- Varieties of complex algebras
- The algebra of topology
- The Complexity of Poor Man's Logic
- An Introduction to Description Logic
- Decidable Elementary Modal Logics
- Kripke models for linear logic
- Mathematical Logic for Life Science Ontologies
- An ascending chain of S4 logics
- The undecidability of the disjunction property of propositional logics and other related problems
- An incomplete logic containing S4
- An incompleteness theorem in modal logic
- Bounded distributive lattice expansions
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
- A Note on Strictly Positive Logics and Word Rewriting Systems
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Boolean Algebras with Operators. Part I
- Bounded lattice expansions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS