{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:40:16Z","timestamp":1777516816027,"version":"3.51.4"},"reference-count":6,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T00:00:00Z","timestamp":1570579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Computability"],"published-print":{"date-parts":[[2020,2,26]]},"abstract":"<jats:p>It is easy to see that no n-REA set can form a (non-trivial) minimal pair with [Formula: see text] and only slightly more difficult to observe that no \u03c9-REA set can form a (non-trivial) minimal pair with [Formula: see text]. Shore has asked whether this can be improved to show that no \u03c9-REA set forms a (non-trivial) minimal pair with [Formula: see text]. We show that no such improvement is possible by constructing an \u03c9-REA set C with [Formula: see text] forming a minimal pair with [Formula: see text]. We then show that no \u03b1-REA set (for any notation \u03b1) can form a (non-trivial) minimal pair with [Formula: see text].<\/jats:p>","DOI":"10.3233\/com-180191","type":"journal-article","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T15:33:26Z","timestamp":1570808006000},"page":"37-50","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["An\n                    <i>\u03c9<\/i>\n                    -REA set forming a minimal pair with 0~\u2032"],"prefix":"10.1177","volume":"9","author":[{"given":"Peter","family":"Gerdes","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA. \u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,10,9]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.2307\/2274273"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01565439"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.2307\/2267778"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2"},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.2307\/1970028"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-180191","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/COM-180191","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-180191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:00:10Z","timestamp":1777392010000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-180191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,9]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,26]]}},"alternative-id":["10.3233\/COM-180191"],"URL":"https:\/\/doi.org\/10.3233\/com-180191","relation":{},"ISSN":["2211-3568","2211-3576"],"issn-type":[{"value":"2211-3568","type":"print"},{"value":"2211-3576","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,9]]}}}