{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:38:55Z","timestamp":1777516735881,"version":"3.51.4"},"reference-count":13,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2016,12,22]]},"DOI":"10.3233\/com-160053","type":"journal-article","created":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T21:34:50Z","timestamp":1482528890000},"page":"23-45","source":"Crossref","is-referenced-by-count":0,"title":["Computably enumerable sets that are automorphic to low sets"],"prefix":"10.1177","volume":"6","author":[{"given":"Peter","family":"Cholak","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Notre Dame, South Bend, IN, USA. cholak@nd.edu."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachel","family":"Epstein","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Swarthmore College, Swarthmore, PA, USA. rachel.epstein@swarthmore.edu."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/COM-160053_ref1","doi-asserted-by":"crossref","unstructured":"P.\u00a0Cholak, Automorphisms of the lattice of recursively enumerable sets, Mem. Amer. Math. Soc. 113(541) (1995), viii+151.","DOI":"10.1090\/memo\/0541"},{"issue":"2","key":"10.3233\/COM-160053_ref2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1142\/S0219061302000151","article-title":"On the definability of the double jump in the computably enumerable sets","volume":"2","author":"Cholak","year":"2002","journal-title":"J.\u00a0Math. Log."},{"key":"10.3233\/COM-160053_ref3","doi-asserted-by":"crossref","unstructured":"R.G.\u00a0Downey, C.G.\u00a0Jockusch Jr. and P.E.\u00a0Schupp, Asymptotic density and computably enumerable sets, J.\u00a0Math. Log. 13(2) (2013), 1350005, 43\u00a0pp.","DOI":"10.1142\/S0219061313500050"},{"issue":"3","key":"10.3233\/COM-160053_ref4","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1090\/S0002-9947-2012-05600-5","article-title":"The nonlow computably enumerable degrees are not invariant in E","volume":"365","author":"Epstein","year":"2013","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1\u20133","key":"10.3233\/COM-160053_ref5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0168-0072(97)00069-9","article-title":"Definable properties of the computably enumerable sets","volume":"94","author":"Harrington","year":"1998","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.3233\/COM-160053_ref6","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1090\/S0894-0347-96-00181-6","article-title":"The \u0394 3 0 -automorphism method and noninvariant classes of degrees","volume":"9","author":"Harrington","year":"1996","journal-title":"J. Amer. Math. Soc."},{"key":"10.3233\/COM-160053_ref7","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2307\/2270328","article-title":"Degrees of recursively enumerable sets which have no maximal supersets","volume":"33","author":"Lachlan","year":"1968","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-160053_ref8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1090\/S0002-9947-1983-0704618-2","article-title":"Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets","volume":"279","author":"Maass","year":"1983","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1,2","key":"10.3233\/COM-160053_ref9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0168-0072(01)00119-1","article-title":"Orbits of computably enumerable sets: Low sets can avoid an upper cone","volume":"118","author":"Miller","year":"2002","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.3233\/COM-160053_ref10","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1017\/S0022481200051252","article-title":"Degrees of classes of recursively enumerable sets","volume":"41","author":"Shoenfield","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-160053_ref11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/1970842","article-title":"Automorphisms of the lattice of recursively enumerable sets I: Maximal sets","volume":"100","author":"Soare","year":"1974","journal-title":"Ann. of Math. (2)"},{"key":"10.3233\/COM-160053_ref12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0003-4843(82)90016-X","article-title":"Automorphisms of the lattice of recursively enumerable sets II: Low sets","volume":"22","author":"Soare","year":"1982","journal-title":"Ann. Math. Logic"},{"key":"10.3233\/COM-160053_ref13","doi-asserted-by":"crossref","unstructured":"R.I.\u00a0Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg, 1987.","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-160053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:59:50Z","timestamp":1777391990000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-160053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":13,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/com-160053","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}