{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:36Z","timestamp":1725663216812},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540119814"},{"type":"electronic","value":"9783540394457"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-11981-7_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:49:26Z","timestamp":1330192166000},"page":"166-185","source":"Crossref","is-referenced-by-count":0,"title":["On the propositional algorithmic theory of arithmetic"],"prefix":"10.1007","author":[{"given":"Grazyna","family":"Mirkowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"12_CR1","unstructured":"Chlebus B., On decidability of propositional algorithmic logic Inst.of Informatics Reports. University of Warsaw, 1979"},{"key":"12_CR2","unstructured":"Malcev A.I., Algorithms and recursive functions, Moscow 1965."},{"key":"12_CR3","unstructured":"Mirkowska G., On the propositional algorithmic logic, Proc. of MFCS'79. Olomouc, Lecture Notes on Computer Science, Springer Verlag 74."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Mirkowska G., Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations Proc. 12 th Ann. ACM Symp. on theory of Computing, Los Angeles 1980.","DOI":"10.1145\/800141.804648"},{"key":"12_CR5","unstructured":"Pratt V.,Salwicki A., personal communication"},{"key":"12_CR6","volume-title":"The theory of recursive functions and effective compitability","author":"H. Rogers","year":"1967","unstructured":"Rogers H., The theory of recursive functions and effective compitability, Mc.Graw-Hill, New York 1967."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs and Their Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-11981-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:30Z","timestamp":1605643530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-11981-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540119814","9783540394457"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-11981-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}