Skip to Main content Skip to Navigation
Journal articles

PDL for ordered trees

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Agnès Vidard Connect in order to contact the contributor
Submitted on : Wednesday, April 5, 2006 - 2:53:07 PM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM


  • HAL Id : inria-00001206, version 1



Loredana Afanasiev, Patrick Blackburn, Ioanna Dimitriou, Bertrand Gaiffe, Evan Goris, et al.. PDL for ordered trees. Journal of Applied Non-Classical Logics, Taylor & Francis, 2005, 15 (2), pp.115--135. ⟨inria-00001206⟩



Les métriques sont temporairement indisponibles