{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:12Z","timestamp":1737288612762,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48686-0_30","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:12Z","timestamp":1184601252000},"page":"300-309","source":"Crossref","is-referenced-by-count":3,"title":["Binary Enumerability of Real Numbers (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"key":"30_CR1","unstructured":"K. Ambos-Spies. A note on recursively approximatable real numbers, Forschungsberichte Mathematische Logik, Mathematisches Institut, Universit\u00e4t Heidelberg. Nr. 38, 1998."},{"key":"30_CR2","series-title":"Lecture Notes in Pure and Applied Mathematics","first-page":"49","volume-title":"Complexity, Logic, and Recursion Theory","author":"M. M. Arslanov","year":"1997","unstructured":"M. M. Arslanov. Degree structures in local degree theory, in Complexity, Logic, and Recursion Theory, Andrea Sorbi (ed.), Lecture Notes in Pure and Applied Mathematics, Vol. 187, Marcel Dekker, New York, Basel, Hong Kong, 1997, pp. 49\u201374."},{"issue":"1","key":"30_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02218750","volume":"7","author":"Y. Ershov","year":"1968","unstructured":"Y. Ershov. On a hierarchy of sets I; II and III, Algebra i Logika, 7 (1968), no. 1, 47\u201373; 7(1968), no. 4, 15 \u2014 47 and 9(1970), no. 1, 34 \u2014 51.","journal-title":"Algebra i Logika"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. M. Gold","year":"1965","unstructured":"E. M. Gold. Limiting recursion J. of Symbolic Logic, 30 (1965), 28\u201348.","journal-title":"J. of Symbolic Logic"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"420","DOI":"10.2307\/1994957","volume":"131","author":"C. G. Jockusch","year":"1968","unstructured":"C. G. Jockusch Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc. 131 (1968), 420\u2013436.","journal-title":"Trans. Amer. Math. Soc."},{"key":"30_CR6","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory, vol. 129 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdan, 1989."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H. Putnam","year":"1965","unstructured":"H. Putnam. Trial and error predicates and solution to a problem of Mostowski, J. of Symbolic Logic, 30 (1965), 49\u201357.","journal-title":"J. of Symbolic Logic"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/1970214","volume":"77","author":"G. E. Sacks","year":"1963","unstructured":"G. E. Sacks On the degrees less than O', Ann. of Math. 77 (1963), 211\u2013231.","journal-title":"Ann. of Math."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1995137","volume":"140","author":"R. Soare","year":"1969","unstructured":"R. Soare Recursion theory and Dedekind cuts, Trans, Amer. Math. Soc. 140 (1969), 271\u2013294.","journal-title":"Trans, Amer. Math. Soc."},{"key":"30_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R. Soare","year":"1987","unstructured":"R. Soare. Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"30_CR11","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch. Computability. EATCS Monographs on Theoretical Computer Science Vol. 9, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"30_CR12","unstructured":"K. Weihrauch. An Introduction to Computable Analysis. (In Preparation.)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"K. Weihrauch and X. Zheng. A finite hierarchy of recursively enumerable real numbers, MFCS'98, Brno, Czech Republic, August 24 \u2014 28, 1998.","DOI":"10.1007\/BFb0055831"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:42:39Z","timestamp":1737286959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}