An Elementary Proof of the Completness of PDL

Dexter Kozen, Rohit Parikh. An Elementary Proof of the Completness of PDL. Theoretical Computer Science, 14:113-118, 1981.

@article{KozenP81,
  title = {An Elementary Proof of the Completness of PDL},
  author = {Dexter Kozen and Rohit Parikh},
  year = {1981},
  researchr = {https://researchr.org/publication/KozenP81},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {14},
  pages = {113-118},
}