{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T19:52:40Z","timestamp":1775505160674,"version":"3.50.1"},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":11368,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematical Logic"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1016\/0003-4843(82)90016-x","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T15:23:56Z","timestamp":1034004236000},"page":"69-107","source":"Crossref","is-referenced-by-count":20,"title":["Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets"],"prefix":"10.1016","volume":"22","author":[{"given":"Robert I.","family":"Soare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0003-4843(82)90016-X_BIB1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(78)90007-5","article-title":"Some lowness properties and computational complexity sequences","volume":"6","author":"Bennison","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/1970103","article-title":"The word problem","volume":"70","author":"Boone","year":"1972","journal-title":"Ann. of Math."},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/1970530","article-title":"Word problems and recursively enumerable degrees of unsolvability, a sequel on finitely presented groups","volume":"84","author":"Boone","year":"1966","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB4","first-page":"236","article-title":"Two recursively enumerable sets of incomparable degrees of unsolvability","volume":"43","author":"Friedberg","year":"1957"},{"key":"10.1016\/0003-4843(82)90016-X_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01700692","article-title":"Uber formal unestscheidb\u00e4re Satze Principia Mathematica und verwandter Systeme I","volume":"38","author":"G\u00f6del","year":"1931","journal-title":"Monatsh. Math. Phys."},{"key":"10.1016\/0003-4843(82)90016-X_BIB6","first-page":"455","article-title":"Subgroups of finitely presented groups","volume":"262","author":"Higman","year":"1961"},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1969708","article-title":"The upper semi-lattice of degrees of recursive unsolvability","volume":"59","author":"Kleene","year":"1954","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB8","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\/0003-4843(82)90016-X_BIB9","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. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0003-4843(76)90016-4","article-title":"A recursively enumerable degree which will not split over all lesser ones","volume":"9","author":"Lachlan","year":"1975","journal-title":"Ann. of Math. Logic"},{"key":"10.1016\/0003-4843(82)90016-X_BIB11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.2307\/2272227","article-title":"Countable initial segments of the degrees of unsolvability","volume":"41","author":"Lachlan","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0003-4843(82)90016-X_BIB12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.2307\/1970779","article-title":"Initial segments of the degrees of unsolvability","volume":"93","author":"Lerman","year":"1971","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB13","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\/0003-4843(82)90016-X_BIB14","doi-asserted-by":"crossref","DOI":"10.2307\/2273100","article-title":"Recursively enumerable genetic sets","author":"Maass","year":"1982","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0003-4843(82)90016-X_BIB15","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\/0003-4843(82)90016-X_BIB16","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."},{"key":"10.1016\/0003-4843(82)90016-X_BIB17","first-page":"279","article-title":"Enumerable sets are diophantine","volume":"191","author":"Matiyasevi\u010d","year":"1970","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0003-4843(82)90016-X_BIB18","first-page":"3","article-title":"Diophantine representation of enumerable predicates","volume":"35","author":"Matiyasevi\u010d","year":"1971","journal-title":"Izv. Akad. Nauk. SSSR Ser. Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB19","first-page":"194","article-title":"On the unsolvability of the problem of reducibility in the theory of algorithms","volume":"108","author":"Muchinik","year":"1956","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0003-4843(82)90016-X_BIB20","series-title":"Trudy Mat. Inst. Steklov no. 44","article-title":"On the algorithmic unsolvability of the world problem in groups","author":"Novikov","year":"1955"},{"key":"10.1016\/0003-4843(82)90016-X_BIB21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","article-title":"Recursively enumerable sets of positive integers and their decision problems","volume":"50","author":"Post","year":"1944","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0003-4843(82)90016-X_BIB22","article-title":"The inclusion lattice and degrees of unsolvability of the recursively enumerable sets","author":"Robinson","year":"1966"},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2307\/1970776","article-title":"Interpolation and embedding in the recursively enumerable degrees","volume":"93","author":"Robinson","year":"1972","journal-title":"Ann. of Math."},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB24","doi-asserted-by":"crossref","first-page":"586","DOI":"10.2307\/1970889","article-title":"Jump restricted interpolation in the n.e. degrees","volume":"93","author":"Robinson","year":"1971","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB25","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.2307\/1970214","article-title":"On the degrees less than O\u2032","volume":"77","author":"Sacks","year":"1963","journal-title":"Ann. of Math."},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB27","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/1970393","article-title":"The recursively enumerable degrees are dense","volume":"80","author":"Sacks","year":"1964","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB28","article-title":"Degrees of unsolvability","volume":"55","author":"Sacks","year":"1966"},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB29","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/1970028","article-title":"On degrees of unsolvability","volume":"69","author":"Shoenfield","year":"1959","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB30","doi-asserted-by":"crossref","first-page":"695","DOI":"10.2307\/2272046","article-title":"Degrees of clasess of r.e. sets","volume":"41","author":"Shoenfield","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0003-4843(82)90016-X_BIB31","first-page":"4218","article-title":"The homogeneity conjecture","volume":"76","author":"Shore","year":"1979"},{"issue":"2","key":"10.1016\/0003-4843(82)90016-X_BIB32","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/1971028","article-title":"First-order theory of the degres of recursive unsolvability","volume":"105","author":"Simpson","year":"1977","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB33","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/1970842","article-title":"Automorphisms of the lattice of recursively enumerable sets. Part I: Maximal sets","volume":"100","author":"Soare","year":"1974","journal-title":"Ann. of Math."},{"key":"10.1016\/0003-4843(82)90016-X_BIB34","doi-asserted-by":"crossref","first-page":"513","DOI":"10.2307\/2272252","article-title":"The infinite injury priority method","volume":"41","author":"Soare","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0003-4843(82)90016-X_BIB35","doi-asserted-by":"crossref","first-page":"545","DOI":"10.2307\/2271876","article-title":"Computational complexity, exceedable and levelable sets","volume":"42","author":"Soare","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0003-4843(82)90016-X_BIB36","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1090\/S0002-9904-1978-14552-2","article-title":"Recursively enumerable sets and degrees","volume":"84","author":"Soare","year":"1978","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0003-4843(82)90016-X_BIB37","series-title":"Proceedings of International Congress of Mathematicians","first-page":"275","article-title":"Recursive Enumerability","author":"Soare","year":"1978"}],"container-title":["Annals of Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000348438290016X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000348438290016X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T22:24:52Z","timestamp":1554762292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000348438290016X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["000348438290016X"],"URL":"https:\/\/doi.org\/10.1016\/0003-4843(82)90016-x","relation":{},"ISSN":["0003-4843"],"issn-type":[{"value":"0003-4843","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}