{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T17:19:43Z","timestamp":1782235183567,"version":"3.54.5"},"reference-count":8,"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":1927,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that a set has an <jats:italic>\u03b7<\/jats:italic>-representation in a linear order if and only if it is the range of a 0\u2032-computable limitwise monotonic function. We also construct a \u0394<jats:sub>3<\/jats:sub> Turing degree for which no set in that degree has a strong <jats:italic>\u03b7<\/jats:italic>-representation, answering a question posed by Downey.<\/jats:p>","DOI":"10.2178\/jsl\/1230396908","type":"journal-article","created":{"date-parts":[[2008,12,27]],"date-time":"2008-12-27T16:55:26Z","timestamp":1230396926000},"page":"1097-1121","source":"Crossref","is-referenced-by-count":19,"title":["<i>\u03b7<\/i>-representation of sets and degrees"],"prefix":"10.1017","volume":"73","author":[{"given":"Kenneth","family":"Harris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200003893_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200003893_ref005","first-page":"1177","volume-title":"Handbook of recursive mathematics","volume":"138","author":"Khisamiev","year":"1998"},{"key":"S0022481200003893_ref003","volume-title":"Handbook of recursive mathematics","volume":"138","author":"Downey","year":"1998"},{"key":"S0022481200003893_ref004","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1187031407"},{"key":"S0022481200003893_ref001","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006031314563"},{"key":"S0022481200003893_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090945"},{"key":"S0022481200003893_ref002","first-page":"1117","volume":"69","author":"Csima","year":"2004","journal-title":"Bounding prime models"},{"key":"S0022481200003893_ref006","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1305\/ndjfl\/1039724885","article-title":"Computable models of theories with few models","volume":"38","author":"Khoussainov","year":"1997","journal-title":"Notre Dame Journal of Formal Logic"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200003893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T21:36:04Z","timestamp":1556660164000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200003893\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["S0022481200003893"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1230396908","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}