Complexity of simple dependent bimodal logics
From MaRDI portal
Recommendations
Cited in
(9)- A fresh view of linear logic as a logical framework
- Computational complexity of multimodal logics based on rough sets
- NEXP-completeness and universal hardness results for justification logic
- Hypersequent rules with restricted contexts for propositional modal logics
- Complexity Results for Modal Dependence Logic
- The bimodal logic of commuting difference operators is decidable
- Modal logics with hard diamond-free fragments
- A linear logic framework for multimodal logics
- PSPACE-completeness of bimodal transitive weak-density logic
This page was built for publication: Complexity of simple dependent bimodal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721196)