Pages that link to "Item:Q5858132"
From MaRDI portal
The following pages link to Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages (Q5858132):
Displaying 4 items.
- 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)
- On Non-axiomatizability of Superintuitionistic Predicate Logics of Some Classes of Well-founded and Dually Well-founded Kripke Frames (Q3431969) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)