Pages that link to "Item:Q5095651"
From MaRDI portal
The following pages link to Complexity and expressivity of propositional dynamic logics with finitely many variables (Q5095651):
Displaying 12 items.
- The comparison of the expressive power of first-order dynamic logics (Q791517) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Complexity of the universal theory of modal algebras (Q2307300) (← 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)
- (Q3393869) (← links)
- ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS (Q3732958) (← links)
- Decision complexity of variants of propositional dynamic logic (Q3897033) (← links)
- Counting variables in a dynamic setting (Q4716050) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Complexity of finite-variable fragments of propositional modal logics of symmetric frames (Q5241916) (← links)
- Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (Q5271051) (← links)
