Pages that link to "Item:Q5241916"
From MaRDI portal
The following pages link to Complexity of finite-variable fragments of propositional modal logics of symmetric frames (Q5241916):
Displaying 6 items.
- Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
