{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:57Z","timestamp":1725663417836},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:35:53Z","timestamp":1330176953000},"page":"276-287","source":"Crossref","is-referenced-by-count":0,"title":["Theories of interacting stacks"],"prefix":"10.1007","author":[{"given":"Helena","family":"Rasiowa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"unstructured":"Constable R.L. and O'Donnel M.J., Programming Logic, Winthrop Publishers, 1978.","key":"23_CR1"},{"doi-asserted-by":"crossref","unstructured":"Harel D., First-Order Dynamic Logic, Lecture Notes in Comp. Sci. 68 (1979).","key":"23_CR2","DOI":"10.1007\/3-540-09237-4"},{"key":"23_CR3","first-page":"225","volume-title":"Induction Rules and Termination Proofs, Automata, Languages and Programming","author":"P. Hitchcock","year":"1973","unstructured":"Hitchcock P. and Park D., Induction Rules and Termination Proofs, Automata, Languages and Programming (ed. Nivat), American Elsevier, New York 1973, 225\u2013251."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/FI-1977-1110","volume":"1","author":"R. Janicki","year":"1977","unstructured":"Janicki R., An algebraic approach to the theory of recursive coroutines, Fundamenta Informaticae I. 1 (1977), 131\u2013145.","journal-title":"Fundamenta Informaticae I"},{"key":"23_CR5","first-page":"799","volume":"20","author":"A. Mazurkiewicz","year":"1972","unstructured":"Mazurkiewicz A., Recursive algorithms and formal languages, Bull. Pol. Ac. Sci. Ser. Math. Astron. Phys. 20 (1972), 799\u2013809.","journal-title":"Bull. Pol. Ac. Sci. Ser. Math. Astron. Phys."},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.3233\/FI-1980-3105","volume":"1","author":"G. Mirkowska","year":"1980","unstructured":"Mirkowska G., Algorithmic logic with nondeterministic programs, Fundamenta Informaticae III. 1 (1980), 45\u201364.","journal-title":"Fundamenta Informaticae III"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1980-3205","volume":"2","author":"G. Mirkowska","year":"1980","unstructured":"Mirkowska G., Model existence theorem for algorithmic logic with nondeterministic programs, Fundamenta Informaticae III. 2 (1980), 157\u2013170.","journal-title":"Fundamenta Informaticae III"},{"doi-asserted-by":"crossref","unstructured":"Pratt V., Semantical consideration on Floyd Hoare Logic, Proc. 17th Symp. on FCS, Houston, Texas, October 1976, 109\u2013121.","key":"23_CR8","DOI":"10.1109\/SFCS.1976.27"},{"doi-asserted-by":"crossref","unstructured":"Rasiowa H., \u03c9+-valued algorithmic logic as a tool to investigate procedures, Proc. MFCS'74, Lecture Notes in Comp. Sci. 28 (1975).","key":"23_CR9","DOI":"10.1007\/3-540-07162-8_702"},{"key":"23_CR10","first-page":"488","volume":"88","author":"H. Rasiowa","year":"1980","unstructured":"Rasiowa H., Completeness in Classical Logic of Complex Algorithms, Proc. MFCS'80, ibid. 88 (1980), 488\u2013503.","journal-title":"Proc. MFCS'80, ibid."},{"unstructured":"Rasiowa H., Logic LNCA of nondeterministic complex algorithms, Proc, 4th Symp. MFCS, Poland-GDR, Diedrichshagen, 6\u201311 Dec. 1982.","key":"23_CR11"},{"unstructured":"Rasiowa H., Complete formalizations of theories of interacting stacks, Abstracts of papers presented to the AMS, Vol. 4, No 1, 89th Annual Meeting, Denver, January 5\u20139, 1983.","key":"23_CR12"},{"unstructured":"Rasiowa H. and Sikorski R., The mathematics of metamathematics, PWN \u2014 Polish Scientific Publishers 3-rd ed. 1970.","key":"23_CR13"},{"key":"23_CR14","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"Salwicki A., Formalized algorithmic languages, Bull. Pol. Ac. Sci., Ser. Math. Astron. Phys. 18 (1970), 227\u2013232.","journal-title":"Bull. Pol. Ac. Sci., Ser. Math. Astron. Phys."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.3233\/FI-1980-3305","volume":"3","author":"A. Salwicki","year":"1980","unstructured":"Salwicki A., On the algorithmic theory of stacks, Fundamenta Informaticae III. 3 (1980), 311\u2013332.","journal-title":"Fundamenta Informaticae III"},{"doi-asserted-by":"crossref","unstructured":"Tiuryn J., A survey of logic of effective definitions, Proc. Conf. Logics of Programs, Z\u00fcrich 1979 (ed. Engeler), Lecture Notes in Comp. Sci., 125 (1981).","key":"23_CR16","DOI":"10.1007\/3-540-11160-3_7"}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T20:40:43Z","timestamp":1640896843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}