{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:43:14Z","timestamp":1767138194965,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540068419","type":"print"},{"value":"9783662215456","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/978-3-662-21545-6_45","type":"book-chapter","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T05:10:34Z","timestamp":1386393034000},"page":"584-600","source":"Crossref","is-referenced-by-count":7,"title":["Effectivity Problems of Algorithmic Logic"],"prefix":"10.1007","author":[{"given":"Antoni","family":"Kreczmar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E Engeler","year":"1967","unstructured":"E. Engeler, Algorithmic properties of structures, Math. Sys. Theory, 1 \/1967\/, 183\u2013195.","journal-title":"Math. Sys. Theory"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"E. Engeler, Remarks on the theory of geometrical constructions, in Syntax and Semantics of Infinitary Languages, Lee. Notes N\u00b0 72 \/1968\/.","DOI":"10.1007\/BFb0079682"},{"key":"45_CR3","unstructured":"E. Engeler, Algorithmic definability, in the Proceedings of Inter.Symp.Summ.Sch. on Math.Found. of Com.Scien., Warsaw \/1972\/"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CA Hoare","year":"1969","unstructured":"C. A. Hoare, An axiomatic basis for computer programming, Com. ACM, 12 \/1969\/, 576\u2013583.","journal-title":"ACM"},{"key":"45_CR5","unstructured":"S. Igarashi, An axiomatic approach to the equivalence problems of algorithms with applications, Rep.Comp.Cent.Univ., Tokyo, 1 \/1968\/."},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(71)90018-4","volume":"1","author":"DE Knuth","year":"1971","unstructured":"D.E. Knuth, R.W.Floyd, Notes on avoiding \u2018goto\u2019 statements, Inf.Proc.Let. 1 \/1971\/, 23\u201331.","journal-title":"Inf.Proc.Let."},{"key":"45_CR7","first-page":"615","volume":"20","author":"A Kreczmar","year":"1972","unstructured":"A. Kreczmar, Degree of recursive unsolvability of algorithmic logic, Bull.Acad.Pol.Sci.Ser.Math., 20 \/1972\/, 615\u2013618.","journal-title":"Bull.Acad.Pol.Sci.Ser.Math."},{"key":"45_CR8","first-page":"253","volume":"22","author":"EG Lopez-Escobar","year":"1968","unstructured":"E.G. Lopez-Escobar, The interpolation theorem for denumerably long formulas, Fund.Math., 22, \/1968\/, 253\u2013272.","journal-title":"Fund.Math."},{"key":"45_CR9","first-page":"1220","volume":"4","author":"DC Luckham","year":"1970","unstructured":"D.C. Luckham, D.M.Park, M.S.Paterson, On formalized computer programs, JCSS, 4 \/1970\/ 1220\u2013249","journal-title":"JCSS"},{"key":"45_CR10","unstructured":"S. Mazur, Computable analysis, Diss.Math., N\u00b0 11 \/1963\/."},{"key":"45_CR11","first-page":"421","volume":"12","author":"M Mirkowska","year":"1971","unstructured":"M. Mirkowska, On formalized systems of algorithmic logic, Bull.Acad.Pol.Sci.Ser.Math., 12 \/1971\/, 421\u2013428.","journal-title":"Bull.Acad.Pol.Sci.Ser.Math."},{"key":"45_CR12","unstructured":"M. Mirkowska, Algorithmic logic and its applications, Doct. Diss., Warsaw \/1972\/, in Polish."},{"key":"45_CR13","unstructured":"H. Rasiowa, R.Sikorski, Mathematics of Metamathematics, Pol. Sc.Publ., Warsaw \/1963\/."},{"key":"45_CR14","unstructured":"H. Rogers Jr., Theory of recursive functions and effective computability, Mc Graw Hill, New York \/1967\/."},{"key":"45_CR15","unstructured":"A. Salwicki, Formalized algorithmic languages, Bull.Acad. Pol.Sci.Ser.Nath., 18 \/1970\/, 227\u2013232."},{"key":"45_CR16","first-page":"275","volume":"18","author":"A Salwicki","year":"1970","unstructured":"A. Salwicki, On the equivalence of FS-expressions and programs, Bull. Acad.Pol. Scl.Ser.MIath., 18 \/1970\/, 275\u2013278.","journal-title":"Bull. Acad.Pol. Scl.Ser.MIath."},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"A. Tarski, A decision method for elementary algebra and geometry, Berkeley, \/1951\/.","DOI":"10.1525\/9780520348097"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21545-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T00:32:15Z","timestamp":1647649935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-21545-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068419","9783662215456"],"references-count":17,"aliases":["10.1007\/3-540-06841-4_92"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21545-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974]]}}}