Kripke completeness of strictly positive modal logics over meet-semilattices with operators
From MaRDI portal
Publication:5222523
Abstract: Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi, and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same consequence relations for a given spi-logic.
Recommendations
Cites work
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 3650525 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3142911 (Why is no real title available?)
- scientific article; zbMATH DE number 4202248 (Why is no real title available?)
- scientific article; zbMATH DE number 3825758 (Why is no real title available?)
- scientific article; zbMATH DE number 3786733 (Why is no real title available?)
- scientific article; zbMATH DE number 3499717 (Why is no real title available?)
- scientific article; zbMATH DE number 3508462 (Why is no real title available?)
- scientific article; zbMATH DE number 3554258 (Why is no real title available?)
- scientific article; zbMATH DE number 3639689 (Why is no real title available?)
- scientific article; zbMATH DE number 697070 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 2079045 (Why is no real title available?)
- scientific article; zbMATH DE number 1852920 (Why is no real title available?)
- scientific article; zbMATH DE number 3231075 (Why is no real title available?)
- scientific article; zbMATH DE number 3198011 (Why is no real title available?)
- scientific article; zbMATH DE number 3019695 (Why is no real title available?)
- A Sahlqvist theorem for distributive modal logic
- A new semantics for positive modal logic
- A note on strictly positive logics and word rewriting systems
- A topological representation theory for lattices
- An ascending chain of S4 logics
- An incomplete logic containing S4
- An incompleteness theorem in modal logic
- An introduction to description logic
- Attributive concept descriptions with complements
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- Boolean Algebras with Operators. Part I
- Bounded distributive lattice expansions
- Bounded lattice expansions
- Calibrating provability logic: from modal logic to reflection calculus
- Constructive canonicity in non-classical logics
- Decidable elementary modal logics
- 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
- Filtration safe operations on frames
- Handbook of modal logic
- Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
- Kripke models for linear logic
- Locality and subsumption testing in \({\mathcal{EL}}\) and some of its extensions
- Mathematical Logic for Life Science Ontologies
- Modal logic
- Model theory
- Monotone bounded distributive lattice expansions
- Natural dualities for semilattice-based algebras
- On the complexity of elementary modal logics
- On the positive fragment of the polymodal provability logic GLP
- On the reflection calculus with partial conservativity operators
- PSPACE-decidability of Japaridze's polymodal logic
- Positive modal logic
- Positive provability logic for uniform reflection principles
- Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Semilattices with closure
- Stability of the Blok theorem
- Stone duality for lattices
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- The algebra of topology
- The complexity of existential quantification in concept languages.
- The complexity of poor man's logic
- The truth about algorithmic problems in correspondence theory
- The undecidability of the disjunction property of propositional logics and other related problems
- Varieties of complex algebras
Cited in
(7)- AN ESCAPE FROM VARDANYAN’S THEOREM
- scientific article; zbMATH DE number 4064960 (Why is no real title available?)
- 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)
