{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:06:40Z","timestamp":1759961200623},"reference-count":11,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":3238,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is shown that there are incomparable \u03a3<jats:sub>2<\/jats:sub> e\u2010degrees <jats:bold><jats:italic>a, b<\/jats:italic><\/jats:bold> such that every e\u2010degree strictly less than <jats:bold><jats:italic>a<\/jats:italic><\/jats:bold> is also less than <jats:bold><jats:italic>b<\/jats:italic><\/jats:bold>.<\/jats:p>","DOI":"10.1002\/malq.19980440402","type":"journal-article","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T08:19:27Z","timestamp":1180599567000},"page":"431-449","source":"Crossref","is-referenced-by-count":17,"title":["Some Special Pairs of \u03a3<sub>2<\/sub> e\u2010Degrees"],"prefix":"10.1002","volume":"44","author":[{"given":"Seema","family":"Ahmad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair H.","family":"Lachlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Ahmad S. Some results on the structure of the \u22112enumeration degrees. Ph. D. dissertation Simon Fraser University1989."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.2307\/2273104"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.2307\/2274181"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0086114"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19880340603"},{"key":"e_1_2_1_7_2","unstructured":"Gutteridge L. Some results on enumeration reducibility. Ph. D. dissertation Simon Fraser University1971."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.2307\/2274335"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/2273985"},{"key":"e_1_2_1_10_2","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers H.","year":"1967"},{"key":"e_1_2_1_11_2","unstructured":"Slaman T. A. andW. H.Woodin Definability in the enumeration degrees. Preprint."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19980440402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19980440402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T00:11:05Z","timestamp":1698538265000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19980440402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1002\/malq.19980440402"],"URL":"https:\/\/doi.org\/10.1002\/malq.19980440402","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}