The following pages link to (Q3647277):
Displaying 3 items.
- Best unifiers in transitive modal logics (Q647403) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
