{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:50:35Z","timestamp":1648799435498},"reference-count":221,"publisher":"Elsevier","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1016\/b978-0-444-51624-4.50010-1","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T19:01:29Z","timestamp":1418151689000},"page":"443-494","source":"Crossref","is-referenced-by-count":2,"title":["Degrees of Unsolvability"],"prefix":"10.1016","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter A.","family":"Fejer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_rf0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02772668","article-title":"Initial segments of the degrees of size \u21351","volume":"53","author":"Abraham","year":"1986","journal-title":"Israel J. Math"},{"issue":"2-3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0010","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0168-0072(01)00028-8","article-title":"Embeddings of N5 and the contiguous degrees","volume":"112","author":"Ambos-Spies","year":"2001","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0015","doi-asserted-by":"crossref","first-page":"257","DOI":"10.2307\/2274050","article-title":"Lattice embeddings into the recursively enumerable degrees","volume":"51","author":"Ambos-Spies","year":"1986","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0020","doi-asserted-by":"crossref","first-page":"735","DOI":"10.2307\/2274738","article-title":"Lattice embeddings into the recursively enumerable degrees II","volume":"54","author":"Ambos-Spies","year":"1989","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0025","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0168-0072(93)90206-S","article-title":"Undecidability and 1-types in the recursively enumerable degrees","volume":"63","author":"Ambos-Spies","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1-2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(89)90042-0","article-title":"The recursively enumerable degrees have infinitely many one-types","volume":"44","author":"Ambos-Spies","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0035","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9947-1984-0719661-8","article-title":"An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees","volume":"28","author":"Ambos-Spies","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0040","series-title":"Logic, Methodology and Philosophy of Science, IX (Uppsala, 1991), volume 134 of Stud. Logic Found. Math","first-page":"179","article-title":"Lattice embeddings into the r.e. degrees preserving 1","author":"Ambos-Spies","year":"1994"},{"issue":"1-3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0045","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0168-0072(99)00011-1","article-title":"Undecidability and 1-types in intervals of the computably enumerable degrees","volume":"106","author":"Ambos-Spies","year":"2000","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0050","series-title":"On the Structure of the Recursively Enumerable Degrees","author":"Ambos-Spies","year":"1980"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0055","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1090\/S0002-9947-1984-0737882-5","article-title":"On pairs of recursively enumerable degrees","volume":"283","author":"Ambos-Spies","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0060","series-title":"Computable structures and the hyperarithmetical hierarchy, volume 144 of Studies in Logic and the Foundations of Mathematics","author":"Ash","year":"2000"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0065","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1090\/S0002-9947-1986-0860377-7","article-title":"Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees","volume":"298","author":"Ash","year":"1986","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0070","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0168-0072(86)90048-5","article-title":"Stability of recursive structures in arithmetical degrees","volume":"32","author":"Ash","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0075","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1073\/pnas.53.2.265","article-title":"Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system (an application of methods of Britton)","volume":"53","author":"Boone","year":"1965","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0080","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2178\/jsl\/1327068690","article-title":"Domination, forcing, array nonrecursiveness and relative recursive enumerability","volume":"77","author":"Cai","year":"2012","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0085","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2178\/jsl\/1327068689","article-title":"Array nonrecursiveness and relative recursive enumerability","volume":"77","author":"Cai","year":"2012","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0090","unstructured":"D. Cenzer and J. B. Remmel. Effectively Closed Sets. ta."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0095","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. Math. Log."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0100","author":"Cholak","year":"2000"},{"issue":"541","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0105","first-page":"viii+151","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\/B978-0-444-51624-4.50010-1_bb0110","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1073\/pnas.50.6.1143","article-title":"The independence of the continuum hypothesis","volume":"50","author":"Cohen","year":"1963","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0115","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90005-7","article-title":"The d.r.e. degrees are not dense","volume":"55","author":"Barry Cooper","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf0115","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0003-4843(72)90011-3","article-title":"Degrees of unsolvability complementary between recursively enumerable degrees. I","volume":"4","author":"Cooper","year":"1972","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0125","doi-asserted-by":"crossref","first-page":"249","DOI":"10.2307\/2272061","article-title":"Minimal degrees and the jump operator","volume":"38","author":"Cooper","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0130","doi-asserted-by":"crossref","first-page":"655","DOI":"10.2307\/2272849","article-title":"Minimal pairs and high recursively enumerable degrees","volume":"39","author":"Cooper","year":"1974","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0135","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1090\/S0273-0979-1990-15923-3","article-title":"The jump is definable in the structure of the degrees of unsolvability","volume":"23","author":"Barry Cooper","year":"1990","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0140","series-title":"Complexity, Logic, and Recursion Theory, volume 187 of Lecture Notes in Pure and Appl. Math","first-page":"93","article-title":"Beyond G\u00f6del\u2019s theorem: the failure to capture information content","author":"Barry Cooper","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0145","author":"Barry Cooper","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0150","series-title":"Handbook of Computability Theory, volume 140 of Stud. Logic Found. Math","first-page":"121","article-title":"Local degree theory","author":"Cooper","year":"1999"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0155","first-page":"17","article-title":"Upper cones as automorphism bases","volume":"9","author":"Cooper","year":"1999","journal-title":"Siberian Adv. Math."},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0160","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1521-3870(200101)47:1<3::AID-MALQ3>3.0.CO;2-A","article-title":"On a conjecture of Kleene and Post","volume":"47","author":"Barry Cooper","year":"2001","journal-title":"Math. Log. Q."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0165","year":"1957"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0170","first-page":"1","article-title":"Reminiscences of logicians","author":"Crossley","year":"1975"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0175","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02219290","article-title":"tt- and m-degrees","volume":"12","author":"D\u00ebgtev","year":"1973","journal-title":"Algebra i Logika"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0180","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1090\/S0002-9947-1958-0097310-7","article-title":"Some theorems on classes of recursively enumerable sets","volume":"89","author":"Dekker","year":"1958","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0185","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1090\/S0002-9939-1954-0063995-6","article-title":"A theorem on hypersimple sets","volume":"5","author":"Dekker","year":"1954","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0190","series-title":"Theory and applications of models of computation, volume 3959 of Lecture Notes in Comput. Sci","first-page":"46","article-title":"Totally<\u03c9\u03c9 computably enumerable and m-topped degrees","author":"Downey","year":"2006"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0195","series-title":"Algorithmic randomness and complexity","author":"Downey","year":"2010"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0200","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.2307\/2275639","article-title":"Contiguity and distributivity in the enumerable Turing degrees","volume":"62","author":"Downey","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0205","series-title":"Recursion theory week (Oberwolfach, 1989), volume 1432 of Lecture Notes in Math","first-page":"141","article-title":"Array nonrecursive sets and multiple permitting arguments","author":"Downey","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0210","series-title":"Computability, enumerability, unsolvability. volume 224 of London Math. Soc. Lecture Note Ser","first-page":"93","article-title":"Array nonrecursive degrees and genericity","author":"Downey","year":"1996"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0215","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1142\/S0219061307000640","article-title":"Totally \u03c9-computably enumerable degrees and bounding critical triples","volume":"7","author":"Downey","year":"2007","journal-title":"J. Math. Log"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0220","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0168-0072(90)90062-7","article-title":"Lattice nonembeddings and initial segments of the recursively enumerable degrees","volume":"49","author":"Downey","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0225","series-title":"Degrees of unsolvability: structure and theory, volume 759 of Lecture Notes in Mathematics","author":"Epstein","year":"1979"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0230","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 \u2130","volume":"365","author":"Epstein","year":"2013","journal-title":"Trans. Amer. Math. Soc"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0235","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/2964178","article-title":"Degrees of unsolvability associated with classes of formalized theories","volume":"22","author":"Feferman","year":"1957","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf0235","first-page":"89","article-title":"Some applications of the notions of forcing and generic sets: Summary","author":"Feferman","year":"1965"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0245","doi-asserted-by":"crossref","first-page":"375","DOI":"10.2307\/2270693","article-title":"The strong homogeneity conjecture","volume":"35","author":"Feiner","year":"1970","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0250","first-page":"49","article-title":"The plus-cupping theorem for the recursively enumerable degrees","author":"Fejer","year":"1981"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0255","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0168-0072(83)90028-3","article-title":"The density of the nonbranching degrees","volume":"24","author":"Fejer","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0260","first-page":"260","article-title":"The solution of Post\u2019s problem by the construction of two recursively enumerable sets of incomparable degrees of unsolvability (abstract)","volume":"62","author":"Friedberg","year":"1956","journal-title":"Bull. Amer. Math. Soc"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0265","first-page":"404","article-title":"The fine structure of degrees of Unsolvability of recursively enumerable sets","author":"Friedberg","year":"1957"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0270","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2964177","article-title":"A criterion for completeness of degrees of unsolvability","volume":"22","author":"Friedberg","year":"1957","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0275","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1073\/pnas.43.2.236","article-title":"Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post\u2019s problem, 1944)","volume":"43","author":"Friedberg","year":"1957","journal-title":"Proc. Nat. Acad. Sci. U.S.A"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0280","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication","volume":"23","author":"Friedberg","year":"1958","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0285","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0219061306000505","article-title":"The theory of the metarecursively enumerable degrees","volume":"6","author":"Greenberg","year":"2006","journal-title":"J. Math. Log"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0290","series-title":"Handbook of Computability Theory, volume 140 of Studies in Logic and the Foundations of Mathematics","author":"Griffor","year":"1999"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0295","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1090\/S0002-9947-1983-0694377-4","article-title":"Independence results on the global structure of the Turing degrees","volume":"277","author":"Groszek","year":"1983","journal-title":"Trans. Amer. Math. Soc"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0300","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4064\/fm-38-1-137-152","article-title":"Undecidability of some topological theories","volume":"38","author":"Grzegorczyk","year":"1951","journal-title":"Fund. Math"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0305","first-page":"445","article-title":"A basis result for \u03a303 sets of reals with an application to minimal covers","volume":"53","author":"Harrington","year":"1975","journal-title":"Proc. Amer. Math. Soc"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0310","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/S0273-0979-1982-14970-9","article-title":"The undecidability of the recursively enumerable degrees","volume":"6","author":"Harrington","year":"1982","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"issue":"22","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0315","doi-asserted-by":"crossref","first-page":"10242","DOI":"10.1073\/pnas.88.22.10242","article-title":"Post\u2019s program and incomplete recursively enumerable sets","volume":"88","author":"Harrington","year":"1991","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0320","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 Logic"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0325","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1090\/S0894-0347-96-00181-6","article-title":"The \u220603-automorphism method and noninvariant classes of degrees","volume":"9","author":"Harrington","year":"1996","journal-title":"J. Amer. Math. Soc"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0330","series-title":"Computability, Enumerability, Unsolvability, volume 224 of London Math. Soc. Lecture Note Ser","first-page":"105","article-title":"Dynamic properties of computably enumerable sets","author":"Harrington","year":"1996"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0335","series-title":"Plus cupping in the recursively enumerable degrees","author":"Harrington","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0340","series-title":"Understanding Lachlan\u2019s monster paper","author":"Harrington","year":"1980"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0345","article-title":"A gentle approach to priority arguments","author":"Harrington","year":"1982"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0350","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/malq.19690152004","article-title":"Some applications of forcing to hierarchy problems in arithmetic","volume":"15","author":"Hinman","year":"1969","journal-title":"Z. Math. Logik Grundlagen Math"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_rf0350","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/plms\/s3-19.1.1","article-title":"Initial segments of Turing degrees","volume":"19","author":"Hugill","year":"1969","journal-title":"Proc. London Math. Soc"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0360","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1090\/S0002-9939-1970-0265154-X","article-title":"Minimal covers and arithmetical sets","volume":"25","author":"Jockusch","year":"1970","journal-title":"Proc. Amer. Math. Soc"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0365","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF02761906","article-title":"Automorphism bases for degrees of unsolvability","volume":"40","author":"Jockusch","year":"1981","journal-title":"Israel J. Math"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0370","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.2307\/2274273","article-title":"Pseudojump operators. II. Transfinite iterations, hierarchies and minimal covers","volume":"49","author":"Jockusch","year":"1984","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0375","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0003-4843(76)90023-1","article-title":"A degree-theoretic definition of the ramified analytical hierarchy","volume":"10","author":"Jockusch","year":"1976","journal-title":"Ann. Math. Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0380","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2275332","article-title":"On the \u03a32-theory of the upper semilattice of Turing degrees","volume":"58","author":"Jockusch","year":"1993","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0385","first-page":"33","article-title":"\u03a001 classes and degrees of theories","volume":"173","author":"Jockusch","year":"1972","journal-title":"Trans. Amer. Math. Soc"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0390","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF03007659","article-title":"Fixed points of jump preserving automorphisms of degrees","volume":"26","author":"Jockusch","year":"1977","journal-title":"Israel J. Math"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0395","doi-asserted-by":"crossref","first-page":"293","DOI":"10.2307\/2272064","article-title":"An application of \u03a304 determinacy to the degrees of unsolvability","volume":"38","author":"Jockusch","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0400","first-page":"110","article-title":"Degrees of generic sets","author":"Jockusch","year":"1980"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0405","first-page":"83","article-title":"Three easy constructions of recursively enumerable sets","author":"Jockusch","year":"1981"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0410","series-title":"Recursion Theory Week (Oberwolfach, 1984), volume 1141 of Lecture Notes in Math.","first-page":"203","article-title":"Genericity for recursively enumerable sets","author":"Jockusch","year":"1985"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0415","series-title":"Review of On a conjecture of Kleene and Post by S. B. Cooper","author":"Jockusch","year":"2002"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0420","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0425","series-title":"Lattice Initial Segments of the Turing Degrees","author":"Kjos-Hanssen","year":"2002"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0430","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2178\/bsl\/1046288724","article-title":"Local initial segments of the Turing degrees","volume":"9","author":"Kjos-Hanssen","year":"2003","journal-title":"Bull. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0435","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. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0440","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/BF01565439","article-title":"General recursive functions of natural numbers","volume":"112","author":"Kleene","year":"1936","journal-title":"Math. Ann."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0445","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1090\/S0002-9947-1943-0007371-8","article-title":"Recursive predicates and quantifiers","volume":"53","author":"Kleene","year":"1943","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0450","series-title":"Introduction to Metamathematics","author":"Cole Kleene","year":"1952"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0455","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MAHC.1981.10004","article-title":"Origins of recursive function theory","volume":"3","author":"Kleene","year":"1981","journal-title":"Ann. Hist. Comput."},{"issue":"vyp. 1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0460","first-page":"3","article-title":"Three approaches to the definition of the concept \u201cquantity of information\u201d","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0465","series-title":"Mathematical Foundations of Computer Science, 1986 (Bratislava, 1986), volume 233 of Lecture Notes in Comput. Sci.","first-page":"493","article-title":"An alternative, priority-free, solution to Post\u2019s problem","author":"Ku\u010dera","year":"1986"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0470","series-title":"Computability, Enumerability, Unsolvability, volume 224 of London Math. Soc. Lecture Note Ser.","first-page":"167","article-title":"Degrees of generic sets","author":"Kumabe","year":"1996"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0475","series-title":"STACS 96 (Grenoble, 1996), volume 1046 of Lecture Notes in Comput. Sci.","first-page":"25","article-title":"On the complexity of random strings (extended abstract)","author":"Kummer","year":"1996"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_rf0475","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"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0485","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0001-8708(80)90027-4","article-title":"Not every finite lattice is embeddable in the recursively enumerable degrees","volume":"37","author":"Lachlan","year":"1980","journal-title":"Adv. in Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0490","doi-asserted-by":"crossref","first-page":"434","DOI":"10.2307\/2270459","article-title":"The impossibility of finding relative complements for recursively enumerable degrees","volume":"31","author":"Lachlan","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0495","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1112\/plms\/s3-16.1.537","article-title":"Lower bounds for pairs of recursively enumerable degrees","volume":"16","author":"Lachlan","year":"1966","journal-title":"Proc. London Math. Soc. (3)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0500","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.1016\/B978-0-444-51624-4.50010-1_bb0505","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/malq.19680143002","article-title":"Distributive initial segments of the degrees of unsolvability","volume":"14","author":"Lachlan","year":"1968","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0510","first-page":"149","article-title":"Embedding nondistributive lattices in the recursively enumerable degrees","volume":"255","author":"Lachlan","year":"1972"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0515","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/2272164","article-title":"Uniform enumeration operations","volume":"40","author":"Lachlan","year":"1975","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0520","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. Math. Logic"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0525","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2273300","article-title":"Bounding minimal pairs","volume":"44","author":"Lachlan","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0530","first-page":"1108","article-title":"Sur le semi-r\u00e9seau constitu\u00e9 par les degr\u00e9s d\u2019ind\u00e9cidabilit\u00e9 r\u00e9cursive","volume":"239","author":"Lacombe","year":"1954","journal-title":"C. R. Acad. Sci. Paris"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0535","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0003-4843(75)90007-8","article-title":"The weak truth table degrees of recursively enumerable sets","volume":"8","author":"Ladner","year":"1975","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0540","series-title":"Recursion theory week (Oberwolfach, 1989), volume 1432 of Lecture Notes in Math.","first-page":"277","article-title":"Priority arguments using iterated trees of strategies","author":"Lempp","year":"1990"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0545","doi-asserted-by":"crossref","first-page":"189","DOI":"10.2307\/421040","article-title":"A general framework for priority arguments","volume":"1","author":"Lempp","year":"1995","journal-title":"Bull. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0550","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/aima.1996.0033","article-title":"The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations","volume":"120","author":"Lempp","year":"1996","journal-title":"Adv. Math."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0555","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0168-0072(96)00031-0","article-title":"A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees","volume":"87","author":"Lempp","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4\u20135","key":"10.1016\/B978-0-444-51624-4.50010-1_rf0555","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s001530050067","article-title":"Iterated trees of strategies and priority arguments","volume":"36","author":"Lempp","year":"1997","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf0560","year":"1993"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0565","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.2307\/2275877","article-title":"The undecidability of the \u03a04-theory for the r.e. wtt and Turing degrees","volume":"60","author":"Lempp","year":"1995","journal-title":"J. Symbolic Logic"},{"issue":"7","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0570","doi-asserted-by":"crossref","first-page":"2719","DOI":"10.1090\/S0002-9947-98-01800-5","article-title":"The \u03a03-theory of the computably enumerable Turing degrees is undecidable","volume":"350","author":"Lempp","year":"1998","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0575","series-title":"Logic Colloquium \u201902, volume 27 of Lect. Notes Log.","first-page":"206","article-title":"Embedding finite lattices into the computably enumerable degrees\u2014a status survey","author":"Lempp","year":"2006"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0580","series-title":"Review of Upper cones as automorphism bases by S. B. Cooper","author":"Lempp","year":"2002"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0585","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1090\/S0002-9947-1988-0973174-0","article-title":"Decidability and invariant classes for degree structures","volume":"310","author":"Lerman","year":"1988","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0590","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."},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0595","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0001-8708(84)90028-8","article-title":"The elementary theory of the recursively enumerable degrees is not \u21350-categorical","volume":"53","author":"Lerman","year":"1984","journal-title":"Adv. in Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0600","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. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf0605","first-page":"311","article-title":"Admissible ordinals and priority arguments","volume":"337","author":"Lerman","year":"1973"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0610","first-page":"A251","article-title":"Automorphism bases for the semilattice of recursively enumerable degrees","volume":"24","author":"Lerman","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0615","series-title":"Perspectives in Mathematical Logic","article-title":"Degrees of Unsolvability","author":"Lerman","year":"1983"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0620","series-title":"Computability, Enumerability, Unsolvability, volume 224 of London Math. Soc. Lecture Note Ser","first-page":"185","article-title":"Embeddings into the recursively enumerable degrees","author":"Lerman","year":"1996"},{"issue":"1\u20133","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0625","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0168-0072(97)00071-7","article-title":"A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees","volume":"94","author":"Lerman","year":"1998","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2\u20133","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0630","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0168-0072(99)00021-4","article-title":"A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees","volume":"101","author":"Lerman","year":"2000","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0635","series-title":"A framework for priority arguments, volume 34 of Lecture Notes in Logic","author":"Lerman","year":"2010"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0640","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."},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0645","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\/B978-0-444-51624-4.50010-1_bb0650","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/BF01098896","article-title":"A class of incomplete sets","volume":"20","author":"Marchenkov","year":"1976","journal-title":"Math. Notes"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0655","series-title":"Martin\u2019s conjecture, arithmetic equivalence, and countable borel equivalence relations","author":"Marks","year":"2011"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0660","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Information and Control"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0665","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 Grundlagen Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0670","first-page":"16","article-title":"Measure, category, and degrees of unsolvability","author":"Martin","year":"1967"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0675","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1090\/S0002-9904-1968-11995-0","article-title":"The axiom of determinateness and reduction principles in the analytical hierarchy","volume":"74","author":"Martin","year":"1968","journal-title":"Bull. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0680","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"102","author":"Martin","year":"1975","journal-title":"Ann. of Math. (2)"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0685","doi-asserted-by":"crossref","first-page":"390","DOI":"10.2178\/bsl\/1154698740","article-title":"Randomness and computability: open questions","volume":"12","author":"Miller","year":"2006","journal-title":"Bull. Symbolic Logic"},{"issue":"8","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0690","doi-asserted-by":"crossref","first-page":"3025","DOI":"10.1090\/S0002-9947-03-03406-8","article-title":"The \u2200\u2203-theory of R(\u2264, \u2228, \u2227) is undecidable","volume":"356","author":"Miller","year":"2004","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0695","first-page":"230","article-title":"High recursively enumerable degrees and the anticupping property","author":"Miller","year":"1981"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0700","doi-asserted-by":"crossref","first-page":"81","DOI":"10.4064\/fm-34-1-81-112","article-title":"On definable sets of positive integers","volume":"34","author":"Mostowski","year":"1947","journal-title":"Fund. Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0705","first-page":"194","article-title":"On the unsolvability of the problem of reducibility in the theory of algorithms","volume":"108","author":"Mu\u010dnik","year":"1956","journal-title":"Dokl. Akad. Nauk SSSR (N.S.)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0710","first-page":"391","article-title":"Solution of Post\u2019s reduction problem and of certain other problems in the theory of algorithms","volume":"7","author":"Mu\u010dnik","year":"1958","journal-title":"Trudy Moskov. Mat. Ob\u0161\u010d."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0715","first-page":"220","article-title":"The lattice of recursively enumerable sets (abstract)","volume":"21","author":"Myhill","year":"1956","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0720","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.2140\/pjm.1961.11.1479","article-title":"Category methods in recursion theory","volume":"11","author":"Myhill","year":"1961","journal-title":"Pacific J. Math."},{"issue":"2\u20133","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0725","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0168-0072(86)90073-4","article-title":"Generic objects in recursion theory II. Operations on recursive approximation spaces","volume":"31","author":"Nerode","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0730","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0003-4843(80)90004-2","article-title":"Reducibility orderings: theories, definability and automorphisms","volume":"18","author":"Nerode","year":"1980","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf0735","first-page":"181","article-title":"Second order logic and first order theories of reducibility orderings","author":"Nerode","year":"1980"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0740","article-title":"Recursion Theory","year":"1985"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0745","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1112\/S002461159800046X","article-title":"Interpretability and definability in the recursively enumerable degrees","volume":"77","author":"Nies","year":"1998","journal-title":"Proc. London Math. Soc. (3)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0750","series-title":"Computability and randomness, volume 51 of Oxford Logic Guides","author":"Nies","year":"2009"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0755","series-title":"Classical Recursion Theory, volume 125 of Studies in Logic and the Foundations of Mathematics","author":"Odifreddi","year":"1989"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0760","series-title":"Classical Recursion Theory. Vol. II, volume 143 of Studies in Logic and the Foundations of Mathematics","author":"Odifreddi","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0765","series-title":"Handbook of Computability Theory, volume 140 of Stud. Logic Found. Math.","first-page":"89","article-title":"Reducibilities","author":"Odifreddi","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0770","doi-asserted-by":"crossref","first-page":"661","DOI":"10.2307\/2272410","article-title":"ZF \u22a2 \u03a304 determinateness","volume":"37","author":"Paris","year":"1972","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0775","doi-asserted-by":"crossref","first-page":"714","DOI":"10.2307\/2273221","article-title":"Degrees joining to 0","volume":"46","author":"Posner","year":"1981","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0780","doi-asserted-by":"crossref","first-page":"705","DOI":"10.2307\/2273220","article-title":"The upper semilattice of degrees \u22640\u2032 is complemented","volume":"46","author":"Posner","year":"1981","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0785","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\/B978-0-444-51624-4.50010-1_bb0790","first-page":"641","article-title":"Degrees of recursive unsolvability: preliminary report (abstract)","volume":"54","author":"Post","year":"1948","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0795","first-page":"338","article-title":"Absolutely unsolvable problems and relatively undecidable propositions","author":"Post","year":"1965"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0800","series-title":"Contemporary Mathematicians","article-title":"Solvability, Provability, Definability: The Collected Works of Emil L Post","author":"Post","year":"1994"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0805","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02761181","article-title":"On automorphisms of the degrees that preserve jumps","volume":"32","author":"Richter","year":"1979","journal-title":"Israel J. Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0810","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":"1971","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0815","doi-asserted-by":"crossref","first-page":"586","DOI":"10.2307\/1970889","article-title":"Jump restricted interpolation in the recursively enumerable degrees","volume":"93","author":"Robinson","year":"1971","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0820","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01342939","article-title":"Computing degrees of unsolvability","volume":"138","author":"Rogers","year":"1959","journal-title":"Math. Ann."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0825","series-title":"Sets, Models and Recursion Theory (Proc. Summer School Math. Logic and Tenth Logic Colloq., Leicester, 1965)","first-page":"183","article-title":"Some problems of definability in recursive function theory","author":"Rogers","year":"1967"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0830","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0835","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2140\/pjm.1968.24.163","article-title":"Initial segments of degrees","volume":"24","author":"Rosenstein","year":"1968","journal-title":"Pacific J. Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0840","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1090\/S0002-9904-1961-10652-6","article-title":"A minimal degree less than 0\u2032","volume":"67","author":"Sacks","year":"1961","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0845","series-title":"Degrees of Unsolvability, volume 55 of Ann. of Math. Studies","author":"Sacks","year":"1963"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0850","doi-asserted-by":"crossref","first-page":"211","DOI":"10.2307\/1970214","article-title":"On the degrees less than 0\u2032","volume":"77","author":"Sacks","year":"1963","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0855","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1090\/S0002-9947-1963-0155747-3","article-title":"Recursive enumerability and the jump operator","volume":"108","author":"Sacks","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf0860","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. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0865","author":"Sacks","year":"1966"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0870","author":"Sacks","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0875","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. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0880","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2307\/2964680","volume":"25","author":"Shoenfield","year":"1960","journal-title":"Degrees of models. J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0885","doi-asserted-by":"crossref","first-page":"171","DOI":"10.4064\/fm-49-2-171-179","article-title":"Undecidable and creative theories","volume":"49","author":"Shoenfield","year":"1961","journal-title":"Fund. Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0890","series-title":"Theory of Models (Proc. 1963 Internat. Sympos. Berkeley)","first-page":"359","article-title":"Applications of model theory to degrees of unsolvability","author":"Shoenfield","year":"1965"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0895","doi-asserted-by":"crossref","first-page":"539","DOI":"10.2307\/2269688","article-title":"A theorem on minimal degrees","volume":"31","author":"Shoenfield","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0900","series-title":"Degrees of Unsolvability","author":"Shoenfield","year":"1971"},{"issue":"6","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0905","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1090\/S0002-9904-1975-13876-6","article-title":"The decision problem for recursively enumerable degrees","volume":"81","author":"Shoenfield","year":"1975","journal-title":"Bull. Amer. Math. Soc."},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0910","doi-asserted-by":"crossref","first-page":"695","DOI":"10.2307\/2272046","article-title":"Degrees of classes of RE sets","volume":"41","author":"Shoenfield","year":"1976","journal-title":"J. Symbolic Logic"},{"issue":"5\u20136","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0915","doi-asserted-by":"crossref","first-page":"711","DOI":"10.4310\/MRL.1999.v6.n6.a10","article-title":"Defining the Turing jump","volume":"6","author":"Shore","year":"1999","journal-title":"Math. Res. Lett."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0920","series-title":"Logic Colloquium \u201903","first-page":"326","article-title":"The \u2200\u2203 theory of D(\u2264, \u2228,\u2032) is undecidable","author":"Shore","year":"2006"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0925","first-page":"331","article-title":"On the \u2200\u2203-sentences of \u03b1-recursion theory","author":"Shore","year":"1978"},{"issue":"9","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0930","doi-asserted-by":"crossref","first-page":"4218","DOI":"10.1073\/pnas.76.9.4218","article-title":"The homogeneity conjecture","volume":"76","author":"Shore","year":"1979","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0935","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/jlms\/s2-24.1.1","article-title":"The theory of the degrees below 0\u2032","volume":"24","author":"Shore","year":"1981","journal-title":"J. London Math. Soc. (2)"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0940","first-page":"256","article-title":"Finitely generated codings and the degrees r.e. in a degree d","volume":"84","author":"Shore","year":"1982","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0945","doi-asserted-by":"crossref","first-page":"8","DOI":"10.2307\/2273376","article-title":"On homogeneity and definability in the first-order theory of the Turing degrees","volume":"47","author":"Shore","year":"1982","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0950","first-page":"287","article-title":"Defining jump classes in the degrees below 0","volume":"104","author":"Shore","year":"1988","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4\u20135","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0955","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001530050063","article-title":"Conjectures and questions from Gerald Sacks\u2019s Degrees of Unsolvability","volume":"36","author":"Shore","year":"1997","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0960","series-title":"Handbook of Computability Theory, volume 140 of Stud. Logic Found. Math.","first-page":"169","article-title":"The recursively enumerable degrees","author":"Shore","year":"1999"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0965","doi-asserted-by":"crossref","first-page":"369","DOI":"10.2178\/bsl\/1154698739","article-title":"Degree structures: local and global investigations","volume":"12","author":"Shore","year":"2006","journal-title":"Bull. Symbolic Logic"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0970","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1142\/S0219061307000676","article-title":"Direct and local definitions of the Turing jump","volume":"7","author":"Shore","year":"2007","journal-title":"J. Math. Log."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0975","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1090\/S0002-9939-2013-11719-3","article-title":"Biinterpretability up to double jump in the degrees below 0\u2032","volume":"142","author":"Shore","year":"2014","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0980","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/1971028","article-title":"First-order theory of the degrees of recursive unsolvability","volume":"105","author":"Simpson","year":"1977","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb0985","series-title":"Perspectives in Logic","article-title":"Subsystems of second order arithmetic","author":"Simpson","year":"2009"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0990","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/3062109","article-title":"Extension of embeddings in the computably enumerable degrees","volume":"154","author":"Slaman","year":"2001","journal-title":"Ann. of Math. (2)"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb0995","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1215\/ijm\/1256044641","article-title":"Definability in the Turing degrees","volume":"30","author":"Slaman","year":"1986","journal-title":"Illinois J. Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_rf1000","series-title":"Definability in degree structures","author":"Slaman","year":"2005"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1005","unstructured":"T. A. Slaman and W. H. Woodin. Definability in Degree Structures. ta."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1010","first-page":"303","article-title":"Degree structures","author":"Slaman","year":"1991"},{"issue":"1\u20132","key":"10.1016\/B978-0-444-51624-4.50010-1_bb1015","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0168-0072(91)90044-M","article-title":"The density of infima in the recursively enumerable degrees","volume":"52","author":"Slaman","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1020","series-title":"Computational prospects of infinity. Part I. Tutorials, volume 14 of Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap.","first-page":"83","article-title":"Global properties of the Turing degrees and the Turing jump","author":"Slaman","year":"2008"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1025","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7_3","article-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1030","series-title":"Handbook of Computability Theory, volume 140 of Stud. Logic Found. Math.","first-page":"3","article-title":"The history and concept of computability","author":"Soare","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1035","doi-asserted-by":"crossref","first-page":"581","DOI":"10.2307\/1969604","article-title":"On degrees of recursive unsolvability","volume":"64","author":"Spector","year":"1956","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1040","doi-asserted-by":"crossref","first-page":"280","DOI":"10.2307\/2964288","article-title":"Measure-theoretic construction of incomparable hyperdegrees","volume":"23","author":"Spector","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1045","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2307\/2272735","article-title":"Decidability of the \u201calmost all\u201d theory of degrees","volume":"37","author":"Stillwell","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1050","doi-asserted-by":"crossref","first-page":"41","DOI":"10.2307\/2271153","article-title":"A theorem on initial segments of degrees","volume":"35","author":"Thomason","year":"1970","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1055","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/malq.19710170131","article-title":"Sublattices of the recursively enumerable degrees","volume":"17","author":"Thomason","year":"1971","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1060","series-title":"Untersuchungen \u00fcber die Struktur des Kleene-Postschen Halbverbandes der Grade der rekursiven Unl\u00f6sbarkeit","author":"Titgemeyer","year":"1962"},{"issue":"45\u201362","key":"10.1016\/B978-0-444-51624-4.50010-1_bb1065","first-page":"1965","article-title":"Untersuchungen \u00fcber die Struktur des Kleene-Postschen Halbverbandes der Grade der rekursiven Unl\u00f6sbarkeit","volume":"8","author":"Titgemeyer","year":"1965","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1070","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungs problem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. Lond. Math. Soc., II. Ser."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1075","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","article-title":"Systems of logic based on ordinals","volume":"45","author":"Turing","year":"1939","journal-title":"Proc. Lond. Math. Soc., II. Ser."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1080","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1215\/S0012-7094-65-03247-3","article-title":"Three theorems on the degrees of recursively enumerable sets","volume":"32","author":"Yates","year":"1965","journal-title":"Duke Math. J."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1085","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2269807","article-title":"A minimal pair of recursively enumerable degrees","volume":"31","author":"Yates","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1090","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1090\/S0002-9947-1966-0184855-9","article-title":"On the degrees of index sets","volume":"121","author":"Yates","year":"1966","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/B978-0-444-51624-4.50010-1_bb1095","series-title":"Mathematical Logic and Foundations of Set Theory","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0049-237X(08)71931-1","article-title":"Initial segments of the degrees of unsolvability. I. A survey","author":"Yates","year":"1970"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50010-1_bb1100","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1017\/S0305004100052221","article-title":"Banach-Mazur games, comeager sets and degrees of unsolvability","volume":"79","author":"Yates","year":"1976","journal-title":"Math. Proc. Cambridge Philos. Soc."}],"container-title":["Handbook of the History of Logic","Computational Logic"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444516244500101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444516244500101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T08:41:32Z","timestamp":1566117692000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444516244500101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":221,"URL":"https:\/\/doi.org\/10.1016\/b978-0-444-51624-4.50010-1","relation":{},"ISSN":["1874-5857"],"issn-type":[{"value":"1874-5857","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}