{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:04:19Z","timestamp":1725728659858},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_44","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T00:28:12Z","timestamp":1370219292000},"page":"371-382","source":"Crossref","is-referenced-by-count":0,"title":["The Turing Universe in the Context of Enumeration Reducibility"],"prefix":"10.1007","author":[{"given":"Mariya I.","family":"Soskova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.2307\/2274914","volume":"56","author":"S. Ahmad","year":"1991","unstructured":"Ahmad, S.: Embedding the diamond in the \u03a32 enumeration degrees. J. Symbolic Logic\u00a056, 195\u2013212 (1991)","journal-title":"J. Symbolic Logic"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022660222520","volume":"42","author":"M.M. Arslanov","year":"2003","unstructured":"Arslanov, M.M., Cooper, S.B., Kalimullin, I.S.: Splitting properties of total enumeration degrees. Algebra and Logic\u00a042, 1\u201313 (2003)","journal-title":"Algebra and Logic"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1112\/S0024610700001459","volume":"62","author":"R. Coles","year":"2000","unstructured":"Coles, R., Downey, R., Slaman, T.: Every set has a least jump enumeration. Bulletin London Math. Soc.\u00a062, 641\u2013649 (2000)","journal-title":"Bulletin London Math. Soc."},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"503","DOI":"10.2307\/2274181","volume":"49","author":"S.B. Cooper","year":"1984","unstructured":"Cooper, S.B.: Partial degrees and the density problem. Part 2: The enumeration degrees of the \u03a32 sets are dense. J. Symbolic Logic\u00a049, 503\u2013513 (1984)","journal-title":"J. Symbolic Logic"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.2178\/jsl\/1208359064","volume":"73","author":"S.B. Cooper","year":"2008","unstructured":"Cooper, S.B., Soskova, M.I.: How enumeration reducibility yields extended Harrington non-splitting. J. Symbolic Logic\u00a073, 634\u2013655 (2008)","journal-title":"J. Symbolic Logic"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/malq.19590050703","volume":"5","author":"R.M. Friedberg","year":"1959","unstructured":"Friedberg, R.M., Rogers Jr., H.: Reducibility and completeness for sets of integers. Z. Math. Logik Grundlag. Math.\u00a05, 117\u2013125 (1959)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"44_CR7","unstructured":"Ganchev, H.A., Soskova, M.I.: Definability via \n                  $\\mathcal{K}$\n                -pairs (submitted)"},{"issue":"1","key":"44_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.2178\/jsl\/1327068696","volume":"77","author":"H.A. Ganchev","year":"2012","unstructured":"Ganchev, H.A., Soskova, M.I.: Cupping and definability in the local structure of the enumeration degrees. J. Symbolic Logic\u00a077(1), 133\u2013158 (2012)","journal-title":"J. Symbolic Logic"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1093\/logcom\/exq042","volume":"22","author":"H.A. Ganchev","year":"2012","unstructured":"Ganchev, H.A., Soskova, M.I.: Embedding distributive lattices in the \n                  $\\Sigma^0_2$\n                 enumeration degrees. J. Logic Comput.\u00a022, 779\u2013792 (2012)","journal-title":"J. Logic Comput."},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Ganchev, H.A., Soskova, M.I.: Interpreting true arithmetic in the local structure of the enumeration degrees. To Appear in J. Symbolic Logic (2012)","DOI":"10.2178\/jsl.7704070"},{"key":"44_CR11","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.2178\/jsl\/1164060448","volume":"71","author":"M. Giorgi","year":"2006","unstructured":"Giorgi, M., Sorbi, A., Yang, Y.: Properly \n                  $\\Sigma^0_2$\n                 enumeration degrees and the high\/low hierarchy. J. Symbolic Logic\u00a071, 1125\u20131144 (2006)","journal-title":"J. Symbolic Logic"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.apal.2005.02.001","volume":"136","author":"S. Goncharov","year":"2005","unstructured":"Goncharov, S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Logic\u00a0136, 219\u2013236 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"key":"44_CR13","unstructured":"Harrington, L.: Understanding Lachlan\u2019s monster paper, Handwritten notes (1980)"},{"issue":"1","key":"44_CR14","first-page":"79","volume":"6","author":"L. Harrington","year":"1982","unstructured":"Harrington, L., Shelah, S.: The undecidability of the recursively enumerable degrees. Bull. Symb. Logic\u00a06(1), 79\u201380 (1982)","journal-title":"Bull. Symb. Logic"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","volume":"131","author":"C.G. Jockusch","year":"1968","unstructured":"Jockusch, C.G.: Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc.\u00a0131, 420\u2013436 (1968)","journal-title":"Trans. Amer. Math. Soc."},{"key":"44_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1142\/S0219061303000285","volume":"3","author":"I.S. Kalimullin","year":"2003","unstructured":"Kalimullin, I.S.: Definability of the jump operator in the enumeration degrees. Journal of Mathematical Logic\u00a03, 257\u2013267 (2003)","journal-title":"Journal of Mathematical Logic"},{"key":"44_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0003-4843(76)90016-4","volume":"9","author":"A.H. Lachlan","year":"1975","unstructured":"Lachlan, A.H.: A recursively enumerable degree which will not split over all lesser ones. Ann. Math. Logic\u00a09, 307\u2013365 (1975)","journal-title":"Ann. Math. Logic"},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1112\/S002461159800046X","volume":"77","author":"A. Nies","year":"1998","unstructured":"Nies, A., Shore, R.A., Slaman, T.A.: Interpretability and definability in the recursively enumerable degrees. Proc. London Math. Soc.\u00a077, 241\u2013249 (1998)","journal-title":"Proc. London Math. Soc."},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"723","DOI":"10.2307\/2273222","volume":"46","author":"L.J. Richter","year":"1981","unstructured":"Richter, L.J.: Degree structures: Local and global investigations. J. Symbolic Logic\u00a046, 723\u2013731 (1981)","journal-title":"J. Symbolic Logic"},{"key":"44_CR20","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers Jr., H.: Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York (1967)"},{"key":"44_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/malq.19710170139","volume":"17","author":"A.L. Selman","year":"1971","unstructured":"Selman, A.L.: Arithmetical reducibilities I. Z. Math. Logik Grundlag. Math.\u00a017, 335\u2013350 (1971)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"44_CR22","unstructured":"Shore, R.A.: Biinterpretability up to double jump in the degrees below 0 (to appear)"},{"key":"44_CR23","doi-asserted-by":"crossref","first-page":"711","DOI":"10.4310\/MRL.1999.v6.n6.a10","volume":"6","author":"R.A. Shore","year":"1999","unstructured":"Shore, R.A., Slaman, T.A.: Defining the Turing jump. Math. Res. Lett.\u00a06, 711\u2013722 (1999)","journal-title":"Math. Res. Lett."},{"key":"44_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.2307\/1971028","volume":"105","author":"S.G. Simpson","year":"1977","unstructured":"Simpson, S.G.: First order theory of the degrees of recursive unsolvability. Annals of Mathematics\u00a0105, 121\u2013139 (1977)","journal-title":"Annals of Mathematics"},{"key":"44_CR25","doi-asserted-by":"crossref","first-page":"\u00f1255","DOI":"10.1007\/s001530050064","volume":"36","author":"T.A. Slaman","year":"1997","unstructured":"Slaman, T.A., Woodin, W.: Definability in the enumeration degrees. Arch. Math. Logic\u00a036, \u00f1255\u2013\u00f1267 (1997)","journal-title":"Arch. Math. Logic"},{"key":"44_CR26","unstructured":"Slaman, T.A., Woodin, W.H.: Definability in degree structures (2005), \n                  \n                    http:\/\/math.berkeley.edu\/slaman\/talks\/sw.pdf"},{"key":"44_CR27","unstructured":"Soskov, I.: A note on \u03c9 jump inversion of degree spectra of structures, This proceedings."},{"key":"44_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s001530050156","volume":"39","author":"I.N. Soskov","year":"2000","unstructured":"Soskov, I.N.: A jump inversion theorem for the enumeration jump. Arch. Math. Logic\u00a039, 417\u2013437 (2000)","journal-title":"Arch. Math. Logic"},{"key":"44_CR29","first-page":"45","volume":"96","author":"I.N. Soskov","year":"2004","unstructured":"Soskov, I.N.: Degree spectra and co-spectra of structures. Ann. Univ. Sofia\u00a096, 45\u201368 (2004)","journal-title":"Ann. Univ. Sofia"},{"key":"44_CR30","unstructured":"Soskova, M.I.: The automorphism group of the enumeration degrees, in preparation"},{"key":"44_CR31","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.apal.2009.01.009","volume":"160","author":"M.I. Soskova","year":"2009","unstructured":"Soskova, M.I.: A non-splitting theorem in the enumeration degrees. Ann. Pure Appl. Logic\u00a0160, 400\u2013418 (2009)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:02:29Z","timestamp":1557752549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}