{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:12Z","timestamp":1759639032111,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540111603"},{"type":"electronic","value":"9783540386315"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-11160-3_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:38:04Z","timestamp":1330191484000},"page":"23-101","source":"Crossref","is-referenced-by-count":11,"title":["PAL \u2014 Propositional algorithmic logic"],"prefix":"10.1007","author":[{"given":"Gra\u017cyna","family":"Mirkowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"3_CR1","unstructured":"Andreka H.,Nemeti I., Completeness of Floyd logic, Bulletin of section of logic, vol. 7 (1978)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Andreka H.,Nemeti I.,Sain I., Completeness problem in verification of programs and program schemes. Proc.MFCS 79 J.Becvar ed. in Lecture Notes on Computer Science vo.74","DOI":"10.1007\/3-540-09526-8_17"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Banachowski L.,Kreczmar A.,Mirkowska G.,Rasiowa H.,Salwicki A., An introduction to algorithmic logic. Metamathematical investigations in the theory of programs, in Banach Center Publications vol.2 Mathematical Foundations of Computer Science (1977)","DOI":"10.4064\/-2-1-7-99"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Berman F., A completeness technique for D-axiomatizable semantics, Proc.11th Ann.ACM Symp.on Thery of Computing Atlanta, Georgia May 1979","DOI":"10.1145\/800135.804409"},{"key":"3_CR5","unstructured":"Chlebus B., On decidability of propositional algorithmic logic, Institute of Informatics Reports, University of Warsaw, 1979"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Constable R., On the theory of programming logics, Proc. 9th Ann.ACM Symp. on Theory of Computing Boulder.Col. May 1977, pp. 269\u2013285","DOI":"10.1145\/800105.803417"},{"issue":"12","key":"3_CR7","first-page":"1073","volume":"XXI","author":"B. Dahn","year":"1973","unstructured":"Dahn B., Generalized Kripke-Models, Bull.de l'Akademie Polonaise des Sci.Ser.Math. vol.XXI No 12(1973), pp. 1073\u20131077","journal-title":"Bull.de l'Akademie Polonaise des Sci.Ser.Math."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E. Engeler","year":"1967","unstructured":"Engeler E., Algorithmic properties of structures, Math.Systems Theory 1 (1967), pp. 183\u2013195","journal-title":"Math.Systems Theory"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Floyd R.W., Assigning Meanings to Programs, in Mathematical Aspects of Computer Science ed. J.T.Schwartz, 1967, pp.19\u201332","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Fisher M.J.,Ladner R.E., Propositional modal logic of programs, Proc. 9th Ann.ACM Symp. on Theory of Computing. Boulder.Col., May 1977, pp.286\u2013294","DOI":"10.1145\/800105.803418"},{"key":"3_CR11","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. No 20 (1972) pp.575\u2013582","journal-title":"Bull.Acad.Pol.Sci.Ser.Math. No"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Harel D.,Pratt V., Nondeterminism in logic of programs, Proc. 9th Ann.ACM Symp. on Theory of Computing, Boulder.Colorado, May 1977, pp.261\u2013268","DOI":"10.1145\/800105.803416"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. Hoare","year":"1969","unstructured":"Hoare C.A., An axiomatic basis for computer programming, CACM 12, (1969), pp.576\u2013580","journal-title":"CACM"},{"key":"3_CR14","volume-title":"A representation theorem for models of-free PDL, Report RC 7864","author":"D. Kozen","year":"1979","unstructured":"Kozen D., A representation theorem for models of-free PDL, Report RC 7864, IBM Research, Yorktown Heights, New York, 1979"},{"key":"3_CR15","volume-title":"On the representation of dynamic algebras, Report RC 7898","author":"D. Kozen","year":"1979","unstructured":"Kozen D., On the representation of dynamic algebras, Report RC 7898, IBM Research, Yorktown Heights, New York, 1979"},{"key":"3_CR16","first-page":"499","volume":"18","author":"G. Mirkowska","year":"1970","unstructured":"Mirkowska G., On formalized systems of algorithmic logic, Bull. Acad.Pol.Sci.Ser.Math. 18 (1970) pp.499\u2013505","journal-title":"Bull. Acad.Pol.Sci.Ser.Math."},{"key":"3_CR17","unstructured":"Mirkowska G., Algorithmic logic with nondeterministic programs, Fundamenta Informaticae"},{"key":"3_CR18","unstructured":"Mirkowska G., Multimodal logic, Technical report, University of Warszaw 1979"},{"key":"3_CR19","unstructured":"Mirkowska G., On algorithmic algebras, manuscript 1980"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Mirkowska G., On propositional algorithmic theory related to arithmetic, manuscript 1980","DOI":"10.1007\/3-540-11160-3_3"},{"key":"3_CR21","unstructured":"Muldner T., Salwicki A., On algorithmic properties of concurent programs, manuscript 1979"},{"key":"3_CR22","unstructured":"Parikh R., A completeness result for PDL, Proc. MFCS '78, Lecture Notes in Computer Science, vol. 64, pp.403\u2013416"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Pratt V., Semantical Considerations of Floyd-Hoare logic, 17th IEEE Symposium on Foundations of Computer Science (1976), 109\u2013121","DOI":"10.1109\/SFCS.1976.27"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Pratt V., Models of program logics, 20th IEEE Conference on Foundations of Computer Science, San Juan, PR,Oct.1979","DOI":"10.1109\/SFCS.1979.24"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Pratt V., Dynamic algebras and the nature of induction, preprint MIT \/LCS\/ TM-159, March 1980","DOI":"10.1145\/800141.804649"},{"key":"3_CR26","unstructured":"Rasiowa H., Sikorski R., Mathematics of Metamathematics, PWN Warszaw 1963"},{"key":"3_CR27","unstructured":"Salwicki A., On algorithmic theory of stacks, ICS PAS report No 337, to appear in Fundamenta Informaticae"},{"issue":"5","key":"3_CR28","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"Salwicki A., Formalized algorithmic languages, Bull.Acad.Pol. Sci.,Ser.Math. vol.18 No5, (1970), pp. 227\u2013232","journal-title":"Bull.Acad.Pol. Sci.,Ser.Math."},{"key":"3_CR29","unstructured":"Segerberg K., A completeness theorem in the modal logic of programs, Notices of the AMS, 24,6, A-552, (1977)"},{"key":"3_CR30","first-page":"1","volume":"1","author":"J. Yanov","year":"1959","unstructured":"Yanov J., On equivalence of operator schemes, Problems of Cybernetic 1, (1959), pp.1\u2013100.","journal-title":"Problems of Cybernetic"}],"container-title":["Lecture Notes in Computer Science","Logic of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-11160-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:15:08Z","timestamp":1742588108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-11160-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540111603","9783540386315"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-11160-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}