Pages that link to "Item:Q3643316"
From MaRDI portal
The following pages link to Complexity of intuitionistic propositional logic and its fragments (Q3643316):
Displaying 5 items.
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Proof theory for positive logic with weak negation (Q2193970) (← 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)
