{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:53Z","timestamp":1725456773142},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029648","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"499-507","source":"Crossref","is-referenced-by-count":0,"title":["Gentzen type axiomatization for PAL"],"prefix":"10.1007","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Fisher M. J. and Ladner R. E., Propositional dynamic logic of regular programs, J. Comput. Syst. Sci. 18 194\u2013211.","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"57_CR2","first-page":"197","volume":"11","author":"D. Harel","year":"1984","unstructured":"Harel D., Dynamic Logic, Handbook of Philosophical Logic Vol 11, 197\u2013604 (1984)","journal-title":"Handbook of Philosophical Logic"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Mirkowska G., PAL \u2014 propositional algorithmic logic, Fund Informaticae 4, 675\u2013760. Also in Lecture Notes in Computer Science, Vol 125, Springler-Verlag pp.23\u2013101 (1981)","DOI":"10.1007\/3-540-11160-3_3"},{"key":"57_CR4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00268322","volume":"12","author":"H. Nishimura","year":"1979","unstructured":"Nishimura H., Sequential Method in Propositional Dynamic Logic, Acta Informatica 12, pp. 377\u2013400 (1979)","journal-title":"Acta Informatica"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Nishimura H., Semantical Analysis of Constructive PDL, Publ. Res. Inst. Math. Sci. Kyoto Univ. (1981)","DOI":"10.2977\/prims\/1195183579"},{"key":"57_CR6","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"Salwicki A., Formalized algorithmic languages, Bull. Acad. Polon Sci. Ser Sci. Math. Astron. Phys. 18, pp. 227\u2013232 (1970)","journal-title":"Bull. Acad. Polon Sci. Ser Sci. Math. Astron. Phys."},{"key":"57_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R.S. Streett","year":"1982","unstructured":"Streett R.S., Propositional dynamic logic of looping and converse is elementary decidable, Inf. and Control 54 pp. 121\u2013141. (1982)","journal-title":"Inf. and Control"},{"key":"57_CR8","unstructured":"Walukiewicz I. Decision procedure for checking validity of PAL formulas to appear in Proceedings of IMYCS 90, Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:49Z","timestamp":1586592949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0029648","relation":{},"subject":[]}}