The following pages link to PDL for ordered trees (Q3647225):
Displayed 5 items.
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
- 2-Exp Time lower bounds for propositional dynamic logics with intersection (Q5486241) (← links)