This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
 L. Aeanasiev , P. Blackburn , I. Dimitriou , B. Gaiffe , E. Goris , M. Maarx . and M. de Rijke , PDL for ordered trees, Journal of Applied Non-Classical Logic, vol. 15 (2005), no. 2, pp. 115–135.
 N. Alechina , S. Demri , and M. de Rijke , A modal perspective on path constraints, Journal of Logic and Computation, vol. 13 (2003), no. 6, pp. 939–956.
 D. Calvanese , G. de Giacomo , and M. Lenzerini , On the decidability of query containment under constraints, Proceedings of the 17th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS'98), 1998, pp. 149–158.
 A. K. Chandra , D. C. Kozen , and L. J. Stockmeyer , Alternation, Journal of the ACM, vol. 28 (1981), no. 1, pp. 114–133.
 R. Danecki , Nondeterministic propositional dynamic logic with intersection is decidable, Proceedings of the Fifth Symposium on Computation Theory (Zaborów, Poland) ( A. Skowron , editor), LNCS, vol. 208, Springer, 1984, pp. 34–53.
 F. M. Donini , M. Lenzerini , D. Nardi , and W. Nutt , The complexity of concept languages, Information and Computation, vol. 134 (1997), no. 1, pp. 1–58.
 M. J. Fischer and R. E. Ladner , Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol. 18 (1979), no. 2, pp. 194–211.
 R. Goldblatt , Parallel action: Concurrent dynamic logic with independent modalities, Studia Logica, vol. 51 (1992), no. 3-4, pp. 551–578.
 D. Harel and R. Sherman , Looping versus repeating in dynamic logic, Information and control, vol. 55 (1982), pp. 175–192.
 C. Lutz and D. Walther , PDL with negation of atomic programs, Journal of Applied Non-Classical Logic, vol. 15 (2005), no. 2, pp. 189–214.
 A. J. Mayer and L. J. Stockmeyer , The complexity of PDL with interleaving, Theoretical Computer Science, vol. 161 (1996), no. 1-2, pp. 109–122.
 R. S. Streett , Propositional dynamic logic of looping and converse is elementarily decidable, Information and Control, vol. 54 (1982), no. 1-2, pp. 121–141.
 M. Y. Vardi , The taming of converse: Reasoning about two-way computations, Proceedings of the Conference on Logic of Programs ( Rohit Parikh , editor), LNCS, vol. 193, Springer, 1985, pp. 413–424.