The following pages link to (Q4501138):
Displaying 5 items.
- Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
- Complexity of the universal theory of modal algebras (Q2307300) (← links)
- A modal logic of epistemic games (Q2344955) (← links)
- Frame definability in finitely valued modal logics (Q6040618) (← links)
- Completing the Picture: Complexity of Graded Modal Logics with Converse (Q6063859) (← links)
