{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:46Z","timestamp":1725558526726},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_62","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"681-690","source":"Crossref","is-referenced-by-count":1,"title":["Ershov\u2019s Hierarchy of Real Numbers"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Rettinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"Gengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"62_CR1","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1006\/jcom.2000.0561","volume":"16","author":"K. Ambos-Spies","year":"2000","unstructured":"Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. Journal of Complexity\u00a016(4), 676\u2013690 (2000)","journal-title":"Journal of Complexity"},{"key":"62_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45335-0_2","volume-title":"Computability and Complexity in Analysis","author":"A.J. Dunlop","year":"2001","unstructured":"Dunlop, A.J., Pour-El, M.B.: The degree of unsolvability of a real number. In: Blanck, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 16\u201329. Springer, Heidelberg (2001)"},{"issue":"1","key":"62_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02218750","volume":"7","author":"Y.L. Ershov","year":"1968","unstructured":"Ershov, Y.L.: A certain hierarchy of sets. i, ii, iii (Russian). Algebra i Logika\u00a07(1), 47\u201373 (1968); 7(4), 15\u201347 (1968); 9, 34\u201351 (1970)","journal-title":"Algebra i Logika"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(98)00098-X","volume":"210","author":"C.-K. Ho","year":"1999","unstructured":"Ho, C.-K.: Relatively recursive reals and real functions. Theoretical Computer Science\u00a0210, 99\u2013120 (1999)","journal-title":"Theoretical Computer Science"},{"key":"62_CR5","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991)"},{"issue":"1","key":"62_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2307\/2266321","volume":"18","author":"J. Myhill","year":"1953","unstructured":"Myhill, J.: Criteria of constructibility for real numbers. The Journal of Symbolic Logic\u00a018(1), 7\u201310 (1953)","journal-title":"The Journal of Symbolic Logic"},{"key":"62_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/3-540-44679-6_65","volume-title":"Computing and Combinatorics","author":"R. Rettinger","year":"2001","unstructured":"Rettinger, R., Zheng, X., Gengler, R., von Braunm\u00fchl, B.: Weakly computable real numbers and total computable real functions. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 586\u2013595. Springer, Heidelberg (2001)"},{"key":"62_CR8","doi-asserted-by":"publisher","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.\u00a05, 784\u2013791 (1954)","journal-title":"Proc. Amer. Math. Soc."},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.2307\/2267933","volume":"16","author":"R.M. Robinson","year":"1951","unstructured":"Robinson, R.M.: Review of Peter, R., Rekursive Funktionen. The Journal of Symbolic Logic\u00a016, 280\u2013282 (1951)","journal-title":"The Journal of Symbolic Logic"},{"key":"62_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.2307\/1970028","volume":"69","author":"J.R. Shoenfield","year":"1959","unstructured":"Shoenfield, J.R.: On degrees of unsolvability. Ann. of Math. (2)\u00a069, 644\u2013653 (1959)","journal-title":"Ann. of Math. (2)"},{"key":"62_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","volume":"31","author":"R. Soare","year":"1969","unstructured":"Soare, R.: Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math.\u00a031, 215\u2013231 (1969)","journal-title":"Pacific J. Math."},{"key":"62_CR12","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively enumerable sets and degrees. A study of computable functions and computably generated sets","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. In: Perspectives in Mathematical Logic. Springer, Berlin (1987)"},{"issue":"3","key":"62_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"Specker, E.: Nicht konstruktiv beweisbare S\u00e4tze der Analysis. The Journal of Symbolic Logic\u00a014(3), 145\u2013158 (1949)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"62_CR14","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Proceedings of the London Mathematical Society\u00a042(2), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"suppl. 1","key":"62_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/1521-3870(200210)48:1+<131::AID-MALQ131>3.0.CO;2-#","volume":"48","author":"X. Zheng","year":"2002","unstructured":"Zheng, X.: Recursive approximability of real numbers. Mathematical Logic Quarterly\u00a048(suppl. 1), 131\u2013156 (2002)","journal-title":"Mathematical Logic Quarterly"},{"issue":"2","key":"62_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/logcom\/13.2.159","volume":"13","author":"X. Zheng","year":"2003","unstructured":"Zheng, X.: On the Turing degrees of weakly computable real numbers. Journal of Logic and Computation\u00a013(2), 159\u2013172 (2003)","journal-title":"Journal of Logic and Computation"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:36:52Z","timestamp":1552613812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}