Complexity of the universal theory of modal algebras
From MaRDI portal
Publication:2307300
DOI10.1007/s11225-018-09842-1zbMath1485.03051OpenAlexW2910349479WikidataQ128592754 ScholiaQ128592754MaRDI QIDQ2307300
Dmitry Shkatov, Clint J. van Alten
Publication date: 27 March 2020
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-018-09842-1
complexityuniversal theorypartial algebraquasi-equational theorymonotonic modal algebranormal modal algebra
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Complexity of the universal theory of residuated ordered groupoids ⋮ Computational complexity for bounded distributive lattices with negation ⋮ Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
Cites Work
- On rules
- Consequence relations and admissible rules
- Hypersequent rules with restricted contexts for propositional modal logics
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
- Propositional dynamic logic of regular programs
- Admissibility of logical inference rules
- A modal perspective on the computational complexity of attribute value grammar
- Domino-tiling games
- Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
- Neighborhood semantics for modal logic
- On closed elements in closure algebras
- STABLE CANONICAL RULES
- Canonical rules
- Using the Universal Modality: Gains and Questions
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- STABLE MODAL LOGICS
- Complexity and expressivity of propositional dynamic logics with finitely many variables
- Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
