{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:55Z","timestamp":1725662995353},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095262"},{"type":"electronic","value":"9783540350880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09526-8_37","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:48:13Z","timestamp":1330188493000},"page":"381-389","source":"Crossref","is-referenced-by-count":2,"title":["On the propositional algorithmic logic"],"prefix":"10.1007","author":[{"given":"Grazyna","family":"Mirkowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Fisher, M., Ladner, R., Propositional dynamic logic of regular programs. Proc. 9th Ann. ACM Symp., Boulder, Colorado, 1977.","DOI":"10.1145\/800105.803418"},{"key":"37_CR2","first-page":"575","volume":"20","author":"M. Grabowski","year":"1972","unstructured":"Grabowski, M., The set of tautologies of zero-order algorithmic logic is decidable, Bull.Acad.Pol.Sci. Ser.Math. 20 (1972), 575\u2013582.","journal-title":"Bull.Acad.Pol.Sci. Ser.Math."},{"key":"37_CR3","first-page":"421","volume":"19","author":"G. Mirkowska","year":"1971","unstructured":"Mirkowska, G., On formalized systems of algorithmic logic, ibid. 19, (1971), 421\u2013428.","journal-title":"Bull.Acad.Pol.Sci. Ser.Math."},{"key":"37_CR4","unstructured":"Mirkowska, G., Algorithmic logic with nondeterministic programs, to appear in Fundamenta Informaticae."},{"key":"37_CR5","unstructured":"Parikh, R., A completeness result for PDL, MFCS, september 1978."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Pratt, V.R., A practical decision method for propositional dynamic logic, Tenth ACM symposium on Theory of Computing, 1978.","DOI":"10.1145\/800133.804362"},{"key":"37_CR7","unstructured":"Rasiowa, H., Sikorski, R., The mathematics of metamathematics, PWN, Warsaw 1963."},{"key":"37_CR8","unstructured":"Segerberg, K., A completeness theorem in the modal logic of programs, Notices of the ACM, 24,6. A-552, 1977."},{"key":"37_CR9","first-page":"1","volume":"1","author":"J. Yanov","year":"1959","unstructured":"Yanov, J., On equivalence of operator schemes, Problems of Cybernetics 1, 1\u2013100, 1959.","journal-title":"Problems of Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1979"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09526-8_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:01:28Z","timestamp":1605643288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09526-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095262","9783540350880"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-09526-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}