Pages that link to "Item:Q2506825"
From MaRDI portal
The following pages link to A general method for proving decidability of intuitionistic modal logics (Q2506825):
Displaying 5 items.
- On expressive power of basic modal intuitionistic logic as a fragment of classical FOL (Q518747) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- On generalized van Benthem-type characterizations (Q2358625) (← links)
- Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
