Budach, Lothar. (1985). [Lecture Notes in Computer Science] Fundamentals of Computation Theory Volume 199 || Quantifiers in combinatory PDL: Completeness, definability, incompleteness. , 10.1007/BFb0028784(Chapter 51), 512–519.
doi:10.1007/bfb0028835