Pages that link to "Item:Q1623150"
From MaRDI portal
The following pages link to Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables (Q1623150):
Displaying 7 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- 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)
- Extending temporal logics with data variable quantifications (Q2978518) (← links)
- (Q4508400) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)