{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T09:28:10Z","timestamp":1773221290556,"version":"3.50.1"},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":3388,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2004,12]]},"abstract":"<jats:title>Abstract.<\/jats:title><jats:p>It is shown that for every (Turing) degree 0 &lt; <jats:italic>a<\/jats:italic> &lt; 0\u2032 there is a minimal degree <jats:italic>m<\/jats:italic> &lt; 0\u2032 such that <jats:italic>a<\/jats:italic> \u2228 <jats:italic>m<\/jats:italic> = 0\u2032 (and therefore <jats:italic>a<\/jats:italic> \u2227 <jats:italic>m<\/jats:italic> = 0).<\/jats:p>","DOI":"10.2178\/jsl\/1102022208","type":"journal-article","created":{"date-parts":[[2005,3,2]],"date-time":"2005-03-02T21:47:42Z","timestamp":1109800062000},"page":"937-966","source":"Crossref","is-referenced-by-count":6,"title":["Minimal complements for degrees below 0\u2032"],"prefix":"10.1017","volume":"69","author":[{"given":"Andrew","family":"Lewis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200007362_ref011","volume-title":"Classical recursion theory","volume":"2","author":"Odifreddi","year":"1999"},{"key":"S0022481200007362_ref012","unstructured":"Posner D. , High degrees, Ph. D. Thesis , University of California, Berkeley, 1977."},{"key":"S0022481200007362_ref016","unstructured":"Seetapun D. and Slaman T. A. , Minimal complements, unpublished, 1992."},{"key":"S0022481200007362_ref003","unstructured":"Cooper S. B. , Lewis A. E. M. , and Yang Yue , Properly \u03a32 minimal degrees and 0\u2033 complementation, to appear."},{"key":"S0022481200007362_ref022","first-page":"243\u2013266","volume":"35","author":"Yates","year":"1970","journal-title":"Initial segments of the degrees of unsolvability, part 2: minimal degrees"},{"key":"S0022481200007362_ref017","first-page":"539\u2013544","volume":"31","author":"Shoenfield","year":"1966","journal-title":"A theorem on minimal degrees"},{"key":"S0022481200007362_ref004","volume":"163","author":"Epstein","year":"1975","journal-title":"Minimal degrees of unsolvability and the full approximation construction"},{"key":"S0022481200007362_ref002","first-page":"249\u2013271","volume":"38","author":"Cooper","year":"1973","journal-title":"Minimal degrees and the jump operator"},{"key":"S0022481200007362_ref008","unstructured":"Lewis A. E. M. , The minimal complementation property above 0\u2032, to appear."},{"key":"S0022481200007362_ref007","volume-title":"Applied Mathematics Letters","author":"Lewis"},{"key":"S0022481200007362_ref005","first-page":"255\u2013256","article-title":"A remark on minimal degrees","volume":"9","author":"Fukuyama","year":"1968","journal-title":"Science Reports of Tokyo Daig."},{"key":"S0022481200007362_ref013","first-page":"705\u2013713","volume":"46","author":"Posner","year":"1981","journal-title":"The uppersemilattice of degrees below 0\u2032 is complemented"},{"key":"S0022481200007362_ref006","first-page":"715\u2013724","volume":"43","author":"Jockusch","year":"1978","journal-title":"Double-jumps of minimal degrees"},{"key":"S0022481200007362_ref019","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200007362_ref015","volume-title":"Degrees of unsolvability","author":"Sacks","year":"1963"},{"key":"S0022481200007362_ref018","first-page":"160\u2013176","volume":"54","author":"Slaman","year":"1989","journal-title":"Complementation in the Turing degrees"},{"key":"S0022481200007362_ref021","first-page":"264\u2013271","volume-title":"Models and recursion theory","author":"Yates","year":"1967"},{"key":"S0022481200007362_ref020","doi-asserted-by":"publisher","DOI":"10.2307\/1969604"},{"key":"S0022481200007362_ref010","first-page":"1\u201321","article-title":"Cupping the recursively enumerable degrees by d-r. e. degrees","volume":"78","author":"Li","year":"1999","journal-title":"Proceedings of the London Mathematical Society"},{"key":"S0022481200007362_ref014","first-page":"714\u2013722","volume":"46","author":"Posner","year":"1981","journal-title":"Degrees joining to 0\u2032"},{"key":"S0022481200007362_ref001","first-page":"157\u2013169","article-title":"Generic sets and minimal \u03b1-degrees","volume":"254","author":"Chong","year":"1979","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200007362_ref009","unstructured":"Lewis A. E. M. , A single minimal complement for the c. e. degrees, to appear."}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200007362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T19:38:46Z","timestamp":1557171526000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200007362\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["S0022481200007362"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1102022208","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}