{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:17Z","timestamp":1725662837474},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540089216"},{"type":"electronic","value":"9783540357575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08921-7_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:36:33Z","timestamp":1330169793000},"page":"239-249","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic theories of real and complex numbers"],"prefix":"10.1007","author":[{"given":"M.","family":"Grabowski","sequence":"first","affiliation":[]},{"given":"A.","family":"Kreczmar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E. Engeler","year":"1967","unstructured":"Engeler E., Algorithmic properties of structures, Math.Sys.Theory 1 (1967), 183\u2013195","journal-title":"Math.Sys.Theory"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Harel D.,Meyer A.R.,Pratt V., Computability and Completeness in Logic of programs, MIT reports (1977)","DOI":"10.1145\/800105.803416"},{"key":"20_CR3","unstructured":"Kfoury D., Comparing algebraic structures up to algorithmic equivalences, Proc. 1st Coll.Aut.Lang.Prog. ed.Nivat North Holland Pub. (1972)"},{"key":"20_CR4","first-page":"781","volume":"19","author":"A. Kreczmar","year":"1971","unstructured":"Kreczmar A., The set of all tautologies of algorithmic logic is hyperarithmetical, Bull.Acad.Pol.Sc.Ser.Math.Astr.Phys. 19(1971) 781\u2013783","journal-title":"Bull.Acad.Pol.Sc.Ser.Math.Astr.Phys."},{"key":"20_CR5","first-page":"615","volume":"20","author":"A. Kreczmar","year":"1972","unstructured":"Kreczmar A., Degree of recursive unsolvability of algorithmic logic, ibid. 20(1972) 615\u2013618","journal-title":"Bull.Acad.Pol.Sc.Ser.Math.Astr.Phys."},{"key":"20_CR6","first-page":"195","volume":"1","author":"A. Kreczmar","year":"1977","unstructured":"Kreczmar A., Programmability in fields, Fund.Infor. 1 (1977) 195\u2013230","journal-title":"Fund.Infor."},{"key":"20_CR7","first-page":"421","volume":"19","author":"G. Mirkowska","year":"1971","unstructured":"Mirkowska G., On formalized systems of algorithmic logic, Bull.Acad.Pol.Sc.Ser.Math.Astr.Phys. 19(1971) 421\u2013428","journal-title":"Bull.Acad.Pol.Sc.Ser.Math.Astr.Phys."},{"key":"20_CR8","unstructured":"Mirkowska G., Model existance theorem in algorithmic logic with nondeterministic programs, Fund.Infor. (to appear)"},{"key":"20_CR9","unstructured":"Mostowski A., Concerning the problem of axiomatizability of the field of real numbers in the weak second order logic, Essays on Found. (1961)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","volume":"5","author":"H. G. Rice","year":"1954","unstructured":"Rice H.G., Recursive real numbers, Proc.Amer.Math.Soc. 5 (1954) 784\u2013791","journal-title":"Proc.Amer.Math.Soc."},{"key":"20_CR11","unstructured":"Rogers H.Jr., Theory of recursive functions and effective computability, McGraw-Hill (1967)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Tarski A., A decision method for elementary algebra and geometry, Berckeley (1951)","DOI":"10.1525\/9780520348097"},{"key":"20_CR13","volume-title":"The concept of truth in formalized languages, Logic, Semantics, Metamathematics","author":"A. Tarski","year":"1956","unstructured":"Tarski A., The concept of truth in formalized languages, Logic, Semantics, Metamathematics, Clarendon Press, Oxford (1956)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Vaught R.L., Some aspects of the theory of models, Amer.Math.Monthly 80,6 (1973)","DOI":"10.2307\/3038220"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1978"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08921-7_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T19:55:07Z","timestamp":1640894107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}