An elementary proof of the completeness of PDL
- 31 December 1981
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 14 (1), 113-118
- https://doi.org/10.1016/0304-3975(81)90019-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Sequential method in propositional dynamic logicActa Informatica, 1979
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979