{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:20:48Z","timestamp":1709832048637},"reference-count":21,"publisher":"Wiley","issue":"4-5","license":[{"start":{"date-parts":[[2004,8,18]],"date-time":"2004-08-18T00:00:00Z","timestamp":1092787200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A real <jats:italic>\u03b1<\/jats:italic> is called a c. e. real if it is the halting probability of a prefix free Turing machine. Equivalently, <jats:italic>\u03b1<\/jats:italic> is c. e. if it is left computable in the sense that <jats:italic>L<\/jats:italic>(<jats:italic>\u03b1<\/jats:italic>) = {<jats:italic>q<\/jats:italic> \u2208 \u211a : <jats:italic>q<\/jats:italic> \u2264 <jats:italic>\u03b1<\/jats:italic>} is a computably enumerable set. The natural field formed by the c. e. reals turns out to be the field formed by the collection of the d. c. e. reals, which are of the form <jats:italic>\u03b1<\/jats:italic>\u2014<jats:italic>\u03b2<\/jats:italic>, where <jats:italic>\u03b1<\/jats:italic> and <jats:italic>\u03b2<\/jats:italic> are c. e. reals. While c. e. reals can only be found in the c. e. degrees, Zheng has proven that there are \u0394<jats:sup>0<\/jats:sup><jats:sub>2<\/jats:sub> degrees that are not even <jats:italic>n<\/jats:italic>\u2010c. e. for any <jats:italic>n<\/jats:italic> and yet contain d. c. e. reals, where a degree is <jats:italic>n<\/jats:italic>\u2010c. e. if it contains an <jats:italic>n<\/jats:italic>\u2010c. e. set. In this paper we will prove that every <jats:italic>\u03c9<\/jats:italic>\u2010c. e. degree contains a d. c. e. real, but there are <jats:italic>\u03c9<\/jats:italic> + 1\u2010c. e. degrees and, hence \u0394<jats:sup>0<\/jats:sup><jats:sub>2<\/jats:sub> degrees, containing no d. c. e. real. (\u00a9 2004 WILEY\u2010VCH Verlag GmbH &amp; Co. KGaA, Weinheim)<\/jats:p>","DOI":"10.1002\/malq.200310103","type":"journal-article","created":{"date-parts":[[2004,8,18]],"date-time":"2004-08-18T12:00:45Z","timestamp":1092830445000},"page":"345-350","source":"Crossref","is-referenced-by-count":9,"title":["Degrees of d. c. e. reals"],"prefix":"10.1002","volume":"50","author":[{"given":"Rod","family":"Downey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2004,8,18]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2000.0561"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"M.Arslanov Degree structures in local degree theory. In: Complexity Logic and Recursion Theory (A. Sorbi ed.) Lecture Notes Pure Applied Mathematics187 pp. 49\u201374 (Marcel Dekker INC New York 1997).","DOI":"10.1201\/9780429187490-2"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"C.Calude R.Coles P.Hertling andB.Khoussainov Degree\u2010theoretic aspects of computably enumerable reals. In: Models and Computability (Cooper and Truss eds.) pp. 23\u201339 (Cambridge University Press Cambridge 1999).","DOI":"10.1017\/CBO9780511565670.003"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"C.Calude P.Hertling B.Khoussainov andY.Wang Recursively enumerable reals and Chaitin's \u03a9 number. In: STACS '98 Lecture Notes in Computer Science1373 pp. 596\u2013606 (Springer\u2010Verlag Berlin 1998).","DOI":"10.1007\/BFb0028594"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"R.Downey D.Hirschfeldt andG.Laforte Randomness and reducibility. In: Mathematical Foundations of Computer Science 2001 (Sgall Pultr and P. Kolman eds.) Lecture Notes in Computer Science2136 pp. 316\u2013327 (Springer\u2010Verlag Berlin 2001). Final version to appear in J. Computing System Sciences.","DOI":"10.1007\/3-540-44683-4_28"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00110-4"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/1521-3870(200210)48:1 <29::AID-MALQ29>3.0.CO;2-O"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02218750"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02218664"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00098-X"},{"key":"e_1_2_1_12_2","unstructured":"M.Li andP.Vitanyi An Introduction to Kolmogorov Complexity and its Applications (2nd edition) (Springer\u2010Verlag New York et al. 1997)."},{"key":"e_1_2_1_13_2","unstructured":"K. M.Ng Master thesis National University of Singapore (in progress)."},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"R.Rettinger X.Zheng R.Gengler andB.von Braunm\u00fchl Weakly computable real numbers and total computable real functions. In: Proceedings of COCOON 2001 Guilin China August 20\u201023 2001 Lecture Notes in Computer Science2108 pp. 586\u2013595 (Springer\u2010Verlag Berlin 2001).","DOI":"10.1007\/3-540-44679-6_65"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","article-title":"Recursive real numbers","volume":"5","author":"Rice H.","year":"1954","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_2_1_16_2","unstructured":"A.Raichev Ph. D. thesis University of Wisconsin\u2010Madison (in progress)."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.2307\/1995137"},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"R. I.Soare Recursively Enumerable Sets and Degrees (Springer\u2010Verlag Berlin 1987).","DOI":"10.1007\/978-3-662-02460-7"},{"key":"e_1_2_1_19_2","first-page":"544","article-title":"On computable numbers with an application to the Entscheidungsproblem","volume":"43","author":"Turing A.","year":"1937","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_2_1_20_2","doi-asserted-by":"crossref","unstructured":"K.Weihrauch Computability (Springer\u2010Verlag Berlin 1987).","DOI":"10.1007\/978-3-642-69965-8"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","unstructured":"K.Weihrauch andX.Zheng Arithmetical hierarchy of real numbers. MFCS'99 Sklarska Poreba Poland September 1999 pp. 23\u201333.","DOI":"10.1007\/3-540-48340-3_3"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.2.159"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.200310103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.200310103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T16:14:47Z","timestamp":1693412087000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.200310103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,18]]},"references-count":21,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1002\/malq.200310103"],"URL":"https:\/\/doi.org\/10.1002\/malq.200310103","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8,18]]}}}