{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:30:09Z","timestamp":1778520609200,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540089216","type":"print"},{"value":"9783540357575","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08921-7_88","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:37:19Z","timestamp":1330169839000},"page":"403-415","source":"Crossref","is-referenced-by-count":37,"title":["The completeness of propositional dynamic logic"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Parikh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"M.J. Fischer and R.E. Ladner, \"Propositional Modal Logic of Programs,\" Proceedings 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado, May 1977, 286\u2013294.","DOI":"10.1145\/800105.803418"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"D. Harel, A.R. Meyer and V.R. Pratt, \"Computability and Completeness in Logics of Programs,\" Ibid., pp. 261\u2013268.","DOI":"10.1007\/3-540-08860-1_20"},{"key":"37_CR3","unstructured":"R. Parikh, \"A Completeness Result for PDL,\" Research report, March 1978."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"R. Parikh, \"A Decidability Result for a Second Order Process Logic,\" Research report, May 1978.","DOI":"10.1109\/SFCS.1978.2"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"V.R. Pratt, \"Semantical Considerations in Floyd-Hoare Logic,\" Proceedings 17th IEEE Symposium on Foundations of Computer Science, 1976.","DOI":"10.1109\/SFCS.1976.27"},{"key":"37_CR6","unstructured":"V.R. Pratt, \"The Tableau Method for Propositional Dynamic Logic,\" Research Report, M.I.T., 11\/31\/77, revised 12\/20\/77."},{"key":"37_CR7","unstructured":"K. Segerberg, \"A Completeness Theorem in the Modal Logic of Programs,\" abstract, Notices of the American Mathematical Society, October 1977, p. A552."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1978"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08921-7_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T19:55:21Z","timestamp":1640894121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}