{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T15:40:12Z","timestamp":1700235612393},"reference-count":7,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:00:00Z","timestamp":1052784000000},"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":[[2003,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is shown that the classes of discrete parts, <jats:italic>A<\/jats:italic> \u2229 \u2115<jats:sup><jats:italic>k<\/jats:italic><\/jats:sup>, of approximately resp. weakly decidable subsets of Euclidean spaces, <jats:italic>A<\/jats:italic> \u2286 \u211d<jats:sup><jats:italic>k<\/jats:italic><\/jats:sup>, coincide and are equal to the class of <jats:italic>\u03c9<\/jats:italic>\u2010r. e. sets which is well\u2010known as the first transfinite level in Ershov's hierarchy exhausting \u0394<jats:sup>0<\/jats:sup><jats:sub>2<\/jats:sub>.<\/jats:p>","DOI":"10.1002\/malq.200310046","type":"journal-article","created":{"date-parts":[[2003,5,16]],"date-time":"2003-05-16T17:32:56Z","timestamp":1053106376000},"page":"428-432","source":"Crossref","is-referenced-by-count":0,"title":["The discrete parts of approximately decidable sets in Euclidean spaces"],"prefix":"10.1002","volume":"49","author":[{"given":"Armin","family":"Hemmerling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"R. L.Epstein R.Haas R. L.Kramer Hierarchies of sets and degrees below 0\u2032. In: Logic Year 1979\u201080 (M. Lerman J. H. Schmerl and R. I. Soare eds.) Lecture Notes in Computer Science 859 pp. 32\u201348 (Springer\u2010Verlag Berlin et al. 1981).","DOI":"10.1007\/BFb0090937"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02218750"},{"key":"e_1_2_1_4_2","unstructured":"F.Hausdorff Mengenlehre (W. de Gruyter & Co. Berlin and Leipzig 1927)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200310003"},{"key":"e_1_2_1_6_2","unstructured":"Y. N.Moschovakis Descriptive Set Theory (North\u2010Holland P. C. Amsterdam et al. 1980)."},{"key":"e_1_2_1_7_2","unstructured":"P.Odifreddi Classical Recursion Theory (North\u2013Holland P. C. Amsterdam et al. 1989)."},{"key":"e_1_2_1_8_2","unstructured":"H.RogersJr. Theory of Recursive Functions and Effective Computability (McGraw\u2013Hill New York 1967)."}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.200310046","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.200310046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T15:11:17Z","timestamp":1700233877000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.200310046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5,13]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["10.1002\/malq.200310046"],"URL":"https:\/\/doi.org\/10.1002\/malq.200310046","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,5,13]]}}}