{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:49:58Z","timestamp":1648601398985},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5403,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0168-0072(97)00069-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:00:04Z","timestamp":1051124404000},"page":"97-125","source":"Crossref","is-referenced-by-count":4,"title":["Definable properties of the computably enumerable sets"],"prefix":"10.1016","volume":"94","author":[{"given":"Leo","family":"Harrington","sequence":"first","affiliation":[]},{"given":"Robert I.","family":"Soare","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(97)00069-9_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01270394","article-title":"Cappable recursively enumerable degrees and Post's program","volume":"32","author":"Ambos-Spies","year":"1992","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01352931","article-title":"The translation theorem","volume":"33","author":"Cholak","year":"1994","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB3","article-title":"Automorphisms of the lattice of recursively enumerable sets","volume":"113","author":"Cholak","year":"1995","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB4","series-title":"Proc. Oberwolfach Conf. on Computability Theory","article-title":"The dense simple sets are orbit complete","author":"Cholak","year":"1996"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB5","unstructured":"[Cholak and Downey, ta] A pair of automorphic computably enumerable sets which are not \u03943-automorphic, Ann. Pure Appl. Logic, to appear."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1090\/S0002-9947-1992-1097164-6","article-title":"Automorphisms of the lattice of recursively enumerable sets: Promptly simple sets","volume":"332","author":"Cholak","year":"1992","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB7","doi-asserted-by":"crossref","unstructured":"[Downey-Harrington, ta] R. Downey, L. Harrington, There is no fat orbit, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(96)83748-1"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0001-8708(92)90065-S","article-title":"Automorphisms of the lattice of recursively enumerable sets: orbits","volume":"92","author":"Downey","year":"1992","journal-title":"Adv. Math."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB9","first-page":"10242","article-title":"Post's Program and incomplete recursively enumerable sets","volume":"88","author":"Harrington","year":"1991"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB10","series-title":"Computability, Enumerability, Unsolvability: Directions in Recursion Theory, Proc. Recursion Theory Conf., University of Leeds","article-title":"Dynamic properties of computably enumerable sets","author":"Harrington","year":"1996"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.2307\/421110","article-title":"Definability, automorphisms, and dynamic properties of computably enumerable sets","volume":"2","author":"Harrington","year":"1996","journal-title":"Bull. Symbolic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB12","doi-asserted-by":"crossref","DOI":"10.1090\/S0894-0347-96-00181-6","article-title":"The \u039430 automorphism method and noninvariant classes of degrees","author":"Harrington","year":"1996","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB13","doi-asserted-by":"crossref","unstructured":"[Harrington-Soare, 1996d] L. Harrington, R.I. Soare, Codable sets and orbits of computably enumerable sets, J. Symbolic Logic, to appear.","DOI":"10.2307\/2586583"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB14","unstructured":"[Harrington-Soare, ta1] L. Harrington, R.I. Soare, Martin's Invariance Conjecture and low sets, in preparation."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2307\/2270328","article-title":"Degrees of recursively enumerable sets which have no maximal superset","volume":"33","author":"Lachlan","year":"1968","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.1016\/S0168-0072(97)00069-9_BIB16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/1970579","article-title":"On some games which are relevant to the theory of recursively enumerable sets","volume":"91","author":"Lachlan","year":"1970","journal-title":"Ann. Math."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.2140\/pjm.1980.87.135","article-title":"d-Simple sets, small sets, and degree classes","volume":"87","author":"Lerman","year":"1980","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB18","doi-asserted-by":"crossref","first-page":"809","DOI":"10.2307\/2273100","article-title":"Recursively enumerable generic sets","volume":"47","author":"Maass","year":"1982","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB19","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."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.2307\/2274090","article-title":"On the orbits of hyperhypersimple sets","volume":"49","author":"Maass","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB21","doi-asserted-by":"crossref","first-page":"138","DOI":"10.2307\/2273796","article-title":"Variations on promptly simple sets","volume":"50","author":"Maass","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB22","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BF02760850","article-title":"Splitting properties and jump classes","volume":"39","author":"Maass","year":"1981","journal-title":"Israel J. Math."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","article-title":"Classes of recursively enumerable sets and degrees of unsolvability","volume":"12","author":"Martin","year":"1966","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"2","key":"10.1016\/S0168-0072(97)00069-9_BIB24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/1970842","article-title":"Automorphisms of the recursively enumerable sets, Part I: Maximal sets","volume":"100","author":"Soare","year":"1974","journal-title":"Ann. Math."},{"key":"10.1016\/S0168-0072(97)00069-9_BIB25","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, Part II: Low sets","volume":"22","author":"Soare","year":"1982","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB26","series-title":"Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets","author":"Soare","year":"1987"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB27","doi-asserted-by":"crossref","first-page":"284","DOI":"10.2307\/420992","article-title":"Computability and recursion","volume":"2","author":"Soare","year":"1996","journal-title":"Bull. Symbolic Logic"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB28","series-title":"Proc. 10th Internat. Congress for Logic, Methodology and the Philosophy of Science, Section 3: Recursion Theory and Constructivism","article-title":"Computability and enumerability","author":"Soare","year":"1995"},{"key":"10.1016\/S0168-0072(97)00069-9_BIB29","doi-asserted-by":"crossref","unstructured":"[Soare, ta] R.I. Soare, An overview of the computably enumerable sets. In: E. Griffor (Ed.), Handbook of Computability Theory, North-Holland, Amsterdam, to appear.","DOI":"10.1016\/S0049-237X(99)80023-8"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007297000699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007297000699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:29:47Z","timestamp":1555576187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007297000699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0168007297000699"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(97)00069-9","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}