The following pages link to (Q3509064):
Displaying 6 items.
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- The complexity of primal logic with disjunction (Q2339598) (← links)
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
