PDL for ordered trees
Résumé
This paper investigates the complexity and expressive power of a language of propositional dynamic logic proposed by Marcus Kracht. The language has four basic programs, corresponding to the child, parent, and left- and right- sibling relations in trees. The paper concentrates on expressivity issues. In particular, it investigates which first-order and second-order properties the language can express.