{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:15Z","timestamp":1759638255726},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T00:00:00Z","timestamp":1131580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T00:00:00Z","timestamp":1131580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s00153-005-0317-8","type":"journal-article","created":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T11:14:15Z","timestamp":1131621255000},"page":"323-350","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The Hausdorff-Ershov Hierarchy in Euclidean Spaces"],"prefix":"10.1007","volume":"45","author":[{"given":"Armin","family":"Hemmerling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,10]]},"reference":[{"key":"317_CR1","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/malq.19960420138","volume":"42","author":"Ash","year":"1996","unstructured":"Ash, C.J., Knight, J.F.: Recursive structures and Ershov's hierarchy. Mathematical Logic Quarterly 42, 461\u2013468 (1996)","journal-title":"Mathematical Logic Quarterly"},{"key":"317_CR2","doi-asserted-by":"crossref","unstructured":"Epstein, R.L., Haas, R., Kramer, R.L.: Hierarchies of sets and degrees below 0'. In: Logic Year 1979\/80, Univ. of Connecticut. M. Lerman, J.H. Schmerl, R.I. Soare, (eds.), LN in Math 859, Springer Verlag, pp. 32\u201348","DOI":"10.1007\/BFb0090937"},{"key":"317_CR3","unstructured":"Ershov, Yu.L.: A hierarchy of sets. I; II; III. Algebra i Logica, v. 7 (1968), no.1, 47-74; no.4, 15-47; v. 9 (1970), no.1, 34\u201351 (English translation by Plenum P.C.)"},{"key":"317_CR4","unstructured":"Hausdorff, F.: Grundz\u00fcge der Mengenlehre. W. de Gruyter & Co., Berlin and Leipzig 1914; Reprint: Chelsea P.C., New York 1949"},{"key":"317_CR5","unstructured":"Hausdorff, F.: Mengenlehre. W. de Gruyter & Co., Berlin and Leipzig, 1927"},{"key":"317_CR6","unstructured":"Hausdorff, F.: Gesammelte Werke, Band II: ``Grundz\u00fcge der Mengenlehre''. E. Brieskorn, S.D. Chatterji, M. Epple, U. Felgner, H. Herrlich, M. Hu\u0161ek, V. Kanovej, P. Koepke, G. Preu\u00df, W. Purkert und E. Scholz, (eds.), Springer Verlag, Berlin, Heidelberg, New York, 2002"},{"key":"317_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(98)00289-8","volume":"219","author":"Hemmerling","year":"1999","unstructured":"Hemmerling, A.: On approximate and algebraic computability over the real numbers. Theoretical Computer Science 219, 185\u2013223 (1999)","journal-title":"Theoretical Computer Science"},{"key":"317_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(01)00093-7","volume":"284","author":"Hemmerling","year":"2002","unstructured":"Hemmerling, A.: Effective metric spaces and representations of the reals. Theoretical Computer Science 284, 347\u2013372 (2002)","journal-title":"Theoretical Computer Science"},{"key":"317_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/malq.200310003","volume":"49","author":"Hemmerling","year":"2003","unstructured":"Hemmerling, A.: Approximate decidability in Euclidean spaces. Mathematical Logic Quarterly 49, 34\u201356 (2003)","journal-title":"Mathematical Logic Quarterly"},{"key":"317_CR10","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/malq.200310108","volume":"50","author":"Hemmerling","year":"2004","unstructured":"Hemmerling, A.: Characterizations of the class \u0394ta\n                           2 over Euclidean spaces. Mathematical Logic Quarterly 50, 507\u2013519 (2004)","journal-title":"Mathematical Logic Quarterly"},{"key":"317_CR11","doi-asserted-by":"crossref","unstructured":"Hemmerling, A.: Hierarchies of function classes defined by the first-value operator. E.-M.-Arndt-Universit\u00e4t Greifswald, Preprint-Reihe Mathematik, Nr. 12\/2004. (PS file available from: http:\/\/www.math-inf.uni-greifswald.de\/preprints\/titel04); Extended abstract in: Proc. of CCA'2004. Electronic Notes in Theoretical Computer Science 120, 59\u201372 (2005)","DOI":"10.1016\/j.entcs.2004.06.034"},{"key":"317_CR12","unstructured":"Hertling, P.: Unstetigkeitsgrade von Funktionen in der effektiven Analysis. Dissertation. Informatik Berichte 208-11\/1996, Fern-Uni Hagen, 1996"},{"key":"317_CR13","unstructured":"Hertling, P., Weihrauch, K.: Levels of degeneracy and exact lower complexity bounds for geometric algorithms. Proc. of the 6th Canadian Conf. on Computational Geometry, Saskatoon, 1994. pp. 237\u2013242"},{"key":"317_CR14","doi-asserted-by":"crossref","unstructured":"Kanovej, V., Koepke, P.: Deskriptive Mengenlehre in Hausdorffs Grundz\u00fcgen der Mengenlehre. In: [6], pp. 773\u2013787","DOI":"10.1007\/978-3-642-59386-4_13"},{"key":"317_CR15","doi-asserted-by":"crossref","unstructured":"Kechris, A.S.: Classical descriptive set theory. Springer Verlag, New York, 1995","DOI":"10.1007\/978-1-4612-4190-4"},{"key":"317_CR16","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Complexity theory of real functions. Birkh\u00e4user, Boston et al., 1991","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"317_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"Ko","year":"1982","unstructured":"Ko, K.-I., Friedman, H.: Computational complexity of real functions. Theoretical Computer Science 20, 323\u2013352 (1982)","journal-title":"Theoretical Computer Science"},{"key":"317_CR18","first-page":"165","volume":"145","author":"Kreitz","year":"1982","unstructured":"Kreitz, C., Weihrauch, K.: Complexity theory on real numbers and functions. LN in Computer Science 145, 165\u2013174 (1982)","journal-title":"LN in Computer Science"},{"key":"317_CR19","unstructured":"Kuratowski, K.: Topology I. Academic Press, New York and London; PWN Warszawa, 1966"},{"key":"317_CR20","unstructured":"Moschovakis, Y.N.: Descriptive set theory. North-Holland P. C., Amsterdam et al., 1980"},{"key":"317_CR21","unstructured":"Odifreddi, P.: Classical recursion theory. North\u2013Holland P.C., Amsterdam et al., 1989"},{"key":"317_CR22","doi-asserted-by":"crossref","unstructured":"Penrose, R.: The emperor's new mind. Oxford University Press, New York, 1989","DOI":"10.1093\/oso\/9780198519737.001.0001"},{"key":"317_CR23","unstructured":"Rogers, H. Jr.: Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967"},{"key":"317_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1051\/ita:2003008","volume":"37","author":"Selivanov","year":"2003","unstructured":"Selivanov, V.L.: Wadge degrees of \u03c9-languages of deterministic Turing machines. Theoretical Informatics and Applications 37, 67\u201383 (2003)","journal-title":"Theoretical Informatics and Applications"},{"key":"317_CR25","unstructured":"Selivanov, V.L.: Difference hierarchy in \u03d5-spaces. Preprint 2003, to appear in: Algebra and Logic"},{"key":"317_CR26","unstructured":"Wadge, W.W.: Reducibility and determinateness in the Baire space. Ph.D. Thesis. Univ. of California, Berkeley 1984"},{"key":"317_CR27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(93)90001-A","volume":"113","author":"Weihrauch","year":"1993","unstructured":"Weihrauch, K.: Computability on computable metric spaces. Theoretical Computer Science 113, 191\u2013210 (1993)","journal-title":"Theoretical Computer Science"},{"key":"317_CR28","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable analysis. Springer\u2013Verlag, Berlin et al., 2000","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-005-0317-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0317-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:03:47Z","timestamp":1652486627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-005-0317-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,10]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["317"],"URL":"https:\/\/doi.org\/10.1007\/s00153-005-0317-8","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,10]]},"assertion":[{"value":"16 March 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2004","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}