{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T03:14:00Z","timestamp":1772075640358,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540128960","type":"print"},{"value":"9783540387756","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12896-4_370","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:56:59Z","timestamp":1330174619000},"page":"313-325","source":"Crossref","is-referenced-by-count":22,"title":["A decision procedure for the propositional \u03bc-calculus"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]},{"given":"Rohit","family":"Parikh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"Fischer, M.J. and R.E. Ladner, \"Propositional Dynamic Logic of Regular Programs,\" J. Comput. Syst. Sci. 18:2 (1979), 194\u2013211.","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Kozen, D., \"Results on the propositional \u03bc-calculus,\" Proc. 9th Int. Colloq. on Automata, Languages, and Programming, 1982, Springer-Verlag, 348\u2013359.","DOI":"10.1007\/BFb0012782"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Pratt, V.R., \"A Decidable \u03bc-calculus (preliminary report),\" Proc. 22nd IEEE Symp. on Foundations of Computer Science, 1981, 421\u2013427.","DOI":"10.1109\/SFCS.1981.4"},{"key":"20_CR4","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Rabin, M.O., \"Decidability of second-order theories and automata on infinite trees,\" Trans. Amer. Math. Soc. 141 (1969), 1\u201335.","journal-title":"Trans. Amer. Math. Soc."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Streett, R., \"Propositional Dynamic Logic of looping and converse,\" Proc. 13th ACM Symp. on Theory of Computing, 1981, 375\u2013383.","DOI":"10.1145\/800076.802492"},{"key":"20_CR6","unstructured":"Scott, D. and J. de Bakker, \"A theory of programs,\" unpublished, Vienna, 1969."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12896-4_370.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:51:38Z","timestamp":1619542298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12896-4_370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540128960","9783540387756"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-12896-4_370","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984]]}}}