{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:32Z","timestamp":1775054072881,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"value":"354010027X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022540","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"656-664","source":"Crossref","is-referenced-by-count":8,"title":["Decision complexity of variants of propositional dynamic logic"],"prefix":"10.1007","author":[{"given":"M. K.","family":"Valiev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Fischer M.J., Ladner R.E. Propositional modal logic of programs. Proc. 9th ACM Symp. on Theory of Computing, 1977, 286\u2013294.","DOI":"10.1145\/800105.803418"},{"key":"49_CR2","unstructured":"Pratt V.R. A near-optimal method for reasoning about action. MIT\/LCS\/TM-113, 1978."},{"key":"49_CR3","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/3-540-09526-8_48","volume":"74","author":"M.K. Valiev","year":"1979","unstructured":"Valiev M.K. On axiomatization of deterministic propositional dynamic logic. Lecture Notes in Computer Science, 74, 1979, 482\u2013491.","journal-title":"Lecture Notes in Computer Science"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Parikh R. A decidability result for a second order process logic. Proc. 19th Symp. on Found. of Computer Science, 1978, 177\u2013183.","DOI":"10.1109\/SFCS.1978.2"},{"key":"49_CR5","unstructured":"Salwicki A. Formalized algorithmic languages. Bull.Acad.Pol.Sci., 18 (1970), No 5., 227\u2013232."},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Pratt V.R. A practical decision method for propositional dynamic logic. Proc. 10th ACM Symp. on Theory of Computing, 1978, 326\u2013337.","DOI":"10.1145\/800133.804362"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Kimura T. An algebraic system for process structuring and interprocess communication. Proc. 8th ACM Symp. on Theory of Computing, 1976, 92\u2013100.","DOI":"10.1145\/800113.803636"},{"key":"49_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-07389-2_183","volume":"32","author":"A. Mazurkiewicz","year":"1975","unstructured":"Mazurkiewicz A. Parallel recursive program schemes. Lecture Notes in Computer Science, 32 (1975), 75\u201387.","journal-title":"Lecture Notes in Computer Science"},{"key":"49_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BFb0022461","volume":"70","author":"K. Abrahamson","year":"1979","unstructured":"Abrahamson K. Modal logic of concunrent nondeterministic programs. Lecture Notes in COmputer Science, 70, 1979, 21\u201333.","journal-title":"Lecture Notes in COmputer Science"},{"key":"49_CR10","volume-title":"The mathematical theory of context-free languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg S. The mathematical theory of context-free languages. Mc Graw-Hill, New York, 1966."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:21:09Z","timestamp":1586578869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0022540","relation":{},"subject":[]}}