An Arithmetical Hierarchy in Propositional Dynamic Logic

We prove that any alternation of modalities in PDL adds to its expressive power. The proof uses Turing machine models wherePDLformulas define the arithmetical hierarchy of sets. As a by-product, we obtain a theorem of Berman and Paterson.