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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.