Solomon Passy, Tinko Tinchev. Quantifiers in combinatory PDL: completeness, definability, incompleteness. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 512-519, Springer, 1985.
Abstract is missing.