{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T04:00:44Z","timestamp":1751169644063,"version":"3.40.3"},"publisher-location":"Cham","reference-count":101,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319500614"},{"type":"electronic","value":"9783319500621"}],"license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50062-1_19","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T10:09:42Z","timestamp":1480500582000},"page":"271-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Enumeration Reducibility and Computable Structure Theory"],"prefix":"10.1007","author":[{"given":"Alexandra A.","family":"Soskova","sequence":"first","affiliation":[]},{"given":"Mariya I.","family":"Soskova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022660222520","volume":"42","author":"MM Arslanov","year":"2003","unstructured":"Arslanov, M.M., Cooper, S.B., Kalimullin, I.S.: Splitting properties of total enumeration degrees. Algebra Logic 42, 1\u201313 (2003)","journal-title":"Algebra Logic"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0168-0072(92)90026-V","volume":"58","author":"CJ Ash","year":"1992","unstructured":"Ash, C.J.: Generalizations of enumeration reducibility using recursive infinitary propositional senetences. Ann. Pure Appl. Logic 58, 173\u2013184 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"19_CR3","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy, Volume 144","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy, Volume 144. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam (2000)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0168-0072(89)90015-8","volume":"42","author":"CJ Ash","year":"1989","unstructured":"Ash, C.J., Knight, J.F., Manasse, M., Slaman, T.: Generic copies of countable structures. Ann. Pure Appl. Logic 42, 195\u2013205 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00153-004-0245-z","volume":"45","author":"V Baleva","year":"2006","unstructured":"Baleva, V.: The jump operation for structure degrees. Arch. Math. Logic 45, 249\u2013265 (2006)","journal-title":"Arch. Math. Logic"},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures","author":"J Barwise","year":"1975","unstructured":"Barwise, J.: Admissible Sets and Structures. Springer, Berlin (1975)"},{"key":"19_CR7","first-page":"35","volume":"95","author":"V Boutchkova","year":"2001","unstructured":"Boutchkova, V.: Genericity in abstract structure degrees. Ann. Sofia Univ. Fac. Math. Inf. 95, 35\u201344 (2001)","journal-title":"Ann. Sofia Univ. Fac. Math. Inf."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cai, M., Ganchev, H.A., Lempp, S., Miller, J.S., Soskova, M.I.: Defining totality in the enumeration degrees. J. Am. Math. Soc. http:\/\/dx.doi.org\/10.1090\/jams\/848","DOI":"10.1090\/jams\/848"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/0003-4843(71)90003-9","volume":"2","author":"J Case","year":"1971","unstructured":"Case, J.: Enumeration reducibility and partial degrees. Ann. Math. Logic 2, 419\u2013439 (1971)","journal-title":"Ann. Math. Logic"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.2307\/2274481","volume":"55","author":"J Chisholm","year":"1990","unstructured":"Chisholm, J.: Effective model theory vs. recursive model theory. J. Symbol. Logic 55, 1168\u20131191 (1990)","journal-title":"J. Symbol. Logic"},{"key":"19_CR11","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. Bull. Lond. Math. Soc. 62, 641\u2013649 (2000)","journal-title":"Bull. Lond. Math. Soc."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.2307\/2274181","volume":"49","author":"SB Cooper","year":"1984","unstructured":"Cooper, S.B.: Partial degrees and the density problem. Part 2: the enumeration degrees of the $$\\Sigma _2$$ sets are dense. J. Symbol. Logic 49, 503\u2013513 (1984)","journal-title":"J. Symbol. Logic"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Downey, R.G.: On presentations of algebraic structures. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, vol. 187, pp. 157\u2013205 (1997)","DOI":"10.1201\/9780429187490-6"},{"key":"19_CR14","first-page":"545","volume":"114","author":"RG Downey","year":"1992","unstructured":"Downey, R.G., Knight, J.F.: Orderings with $$\\alpha $$-th jump degree $${\\bf {0}}^{(\\alpha )}$$. Proc. Am. Math. Soc. 114, 545\u2013552 (1992)","journal-title":"Proc. Am. Math. Soc."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.2307\/2270699","volume":"35","author":"HB Enderton","year":"1970","unstructured":"Enderton, H.B., Putnam, H.: A note on the hyperarithmetical hierarchy. J. Symbol. Logic 35, 429\u2013430 (1970)","journal-title":"J. Symbol. Logic"},{"key":"19_CR16","first-page":"767","volume":"3","author":"YL Ershov","year":"1985","unstructured":"Ershov, Y.L.: $$\\Sigma $$-denability in admissible sets. Sov. Math. Dokl. 3, 767\u2013770 (1985)","journal-title":"Sov. Math. Dokl."},{"key":"19_CR17","unstructured":"Ershov, Y.L.: Definability and Computability. Consultants Bureau, New York-London-Moscow (1996)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Ershov, Y., Puzarenko, V.G., Stukachev, A.I.: HF-computability. In: Cooper, B.S., Sorbi, A. (eds.) Computability in Context Computation and Logic in the Real World, pp. 169\u2013242. Imperial College Press (2011)","DOI":"10.1142\/9781848162778_0006"},{"key":"19_CR19","unstructured":"Fraisse, R.: Une notion de recursivite relative. In: Proceedings of the Symposium of Mathematics 1959, Infinistic Methods, pp. 323\u2013328. Pergamon Press, Warsaw (1961)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/malq.19590050703","volume":"5","author":"RM Friedberg","year":"1959","unstructured":"Friedberg, R.M., Rogers Jr., H.: Reducibility and completeness for sets of integers. Z. Math. Logik Grundlag. Math. 5, 117\u2013125 (1959)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Friedman, H.: Algorithmic procedures, generalized turing algorithms and elementary recursion theory. In: Gandy, R.O., Yates, C.E.M. (eds.) Logic Colloquium-69, pp. 361\u2013389. North-Holland, Amsterdam (1971)","DOI":"10.1016\/S0049-237X(08)71238-2"},{"key":"19_CR22","unstructured":"Ganchev, H.: A total degree splitting theorem and a jump inversion splitting theorem. In: Proceedings of the 5th Panhellenic Logic Symposium, Athens, Greece, pp. 79\u201381 (2005)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-73001-9_33","volume-title":"Computation and Logic in the Real World","author":"H Ganchev","year":"2007","unstructured":"Ganchev, H.: Exact pair theorem for the $$\\omega $$-enumeration degrees. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 316\u2013324. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-73001-9_33"},{"key":"19_CR24","first-page":"61","volume":"98","author":"H Ganchev","year":"2008","unstructured":"Ganchev, H.: A jump inversion theorem for the infinite enumeration jump. Ann. Univ. Sofia Univ. 98, 61\u201385 (2008)","journal-title":"Ann. Univ. Sofia Univ."},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-03073-4_25","volume-title":"Mathematical Theory and Computational Practice","author":"H Ganchev","year":"2009","unstructured":"Ganchev, H.: Definability in the local theory of the $$\\omega $$-enumeration degrees. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 242\u2013249. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03073-4_25"},{"key":"19_CR26","unstructured":"Ganchev, H., Soskov, I.N.: The groups Aut($$\\mathcal{D}^{\\prime }_{\\omega }$$) and Aut($$\\mathcal{D}_e$$) are isomorphic. In: Proceedings of the 6th Panhellenic Logic Symposium, Volos, Greece, pp. 53\u201357 (2007)"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.apal.2009.01.003","volume":"160","author":"H Ganchev","year":"2009","unstructured":"Ganchev, H., Soskov, I.N.: The jump operator on the $$\\omega $$-enumeration degrees. Ann. Pure Appl. Logic 160, 289\u2013301 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"5","key":"19_CR28","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.apal.2010.10.004","volume":"163","author":"H Ganchev","year":"2012","unstructured":"Ganchev, H., Soskova, M.: The high\/low hierarchy in the local structure of the $$\\omega $$-enumeration degrees. Ann. Pure Appl. Logic 163(5), 547\u2013566 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.2178\/jsl.7704070","volume":"77","author":"HA Ganchev","year":"2012","unstructured":"Ganchev, H.A., Soskova, M.I.: Interpreting true arithmetic in the local structure of the enumeration degrees. J. Symbol. Log. 77(4), 1184\u20131194 (2012)","journal-title":"J. Symbol. Log."},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"4873","DOI":"10.1090\/S0002-9947-2014-06157-6","volume":"367","author":"HA Ganchev","year":"2015","unstructured":"Ganchev, H.A., Soskova, M.I.: Definability via Kalimullin pairs in the structure of the enumeration degrees. Trans. AMS 367, 4873\u20134893 (2015)","journal-title":"Trans. AMS"},{"issue":"6","key":"19_CR31","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/B:ALLO.0000048826.92325.02","volume":"43","author":"S Goncharov","year":"2004","unstructured":"Goncharov, S., Khoussainov, B.: Complexity of categorical theories with computable models. Algebra Logic 43(6), 365\u2013373 (2004)","journal-title":"Algebra Logic"},{"issue":"3","key":"19_CR32","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 136(3), 219\u2013246 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"key":"19_CR33","doi-asserted-by":"publisher","unstructured":"Greenberg, N., Montalb\u00e1n, A., Slaman, T.A.: Relative to any non-hyperarithmetic set. J. Math. Logic 13(01) (2013). doi:10.1142\/S0219061312500079","DOI":"10.1142\/S0219061312500079"},{"key":"19_CR34","first-page":"333","volume":"22","author":"C Gordon","year":"1970","unstructured":"Gordon, C.: Comparisons between some generalizations of recursion theory. Compos. Math. 22, 333\u2013346 (1970)","journal-title":"Compos. Math."},{"key":"19_CR35","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1090\/S0002-9947-2011-05331-6","volume":"364","author":"K Harris","year":"2012","unstructured":"Harris, K., Montab\u00e1n, A.: On the $$n$$-back-and-forth types of Boolean algebras. Trans. AMS 364, 827\u2013866 (2012)","journal-title":"Trans. AMS"},{"key":"19_CR36","unstructured":"Jojgov, G.: Minimal pairs of structure degrees. Master\u2019s thesis, Sofia University (1997)"},{"key":"19_CR37","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","volume":"131","author":"CG Jockusch Jr","year":"1968","unstructured":"Jockusch Jr., C.G.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-73001-9_40","volume-title":"Computation and Logic in the Real World","author":"I Kalimullin","year":"2007","unstructured":"Kalimullin, I.: Some notes on degree spectra of the structures. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 389\u2013397. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-73001-9_40"},{"issue":"1","key":"19_CR39","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1093\/logcom\/exn032","volume":"19","author":"IS Kalimullin","year":"2009","unstructured":"Kalimullin, I.S.: Enumeration degrees and enumerability of families. J. Logic Comput. 19(1), 151\u2013158 (2009)","journal-title":"J. Logic Comput."},{"key":"19_CR40","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.2307\/2273915","volume":"51","author":"JF Knight","year":"1986","unstructured":"Knight, J.F.: Degrees coded in jumps of orderings. J. Symbol. Logic 51, 1034\u20131042 (1986)","journal-title":"J. Symbol. Logic"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Knight, J.F.: Degrees of models. In: Handbook of Recursive Mathematics, Volume 1, Studies Logic Foundations of Mathematics, vol. 138, pp. 289\u2013309. North-Holland, Amsterdam (1998)","DOI":"10.1016\/S0049-237X(98)80008-6"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Kreisel, G.: Some reasons for generalizing recursion theory. In: Gandy, R.O., Yates, C.E.M. (eds.) Logic Colloquium 69, pp. 139\u2013198. North Holland (1971)","DOI":"10.1016\/S0049-237X(08)71230-8"},{"key":"19_CR43","doi-asserted-by":"publisher","first-page":"318","DOI":"10.2307\/2269621","volume":"30","author":"G Kreisel","year":"1965","unstructured":"Kreisel, G., Sacks, G.E.: Metarecursive sets. J. Symbol. Logic 30, 318\u2013338 (1965)","journal-title":"J. Symbol. Logic"},{"key":"19_CR44","first-page":"161","volume":"29","author":"S Kripke","year":"1964","unstructured":"Kripke, S.: Transfinite recursion on admissible ordinals, I, II (abstracts). J. Symbol. Logic 29, 161\u2013162 (1964)","journal-title":"J. Symbol. Logic"},{"key":"19_CR45","first-page":"3410","volume":"258","author":"D Lacombe","year":"1964","unstructured":"Lacombe, D.: Deux generalizations de la notion de recursivite relative. C. R. de l-Academie des Sciences de Paris 258, 3410\u20133413 (1964)","journal-title":"C. R. de l-Academie des Sciences de Paris"},{"issue":"2","key":"19_CR46","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0219061305000432","volume":"5","author":"S Lempp","year":"2005","unstructured":"Lempp, S., Slaman, T.A., Sorbi, A.: On extensions of embeddings into the enumeration degrees of the $$\\Sigma ^0_2$$-sets. J. Math. Log. 5(2), 247\u2013298 (2005)","journal-title":"J. Math. Log."},{"issue":"3","key":"19_CR47","doi-asserted-by":"publisher","first-page":"921","DOI":"10.2307\/2274752","volume":"54","author":"D Marker","year":"1989","unstructured":"Marker, D.: Non $$\\Sigma _n$$-axiomatizable almost strongly minimal theories. J. Symbol. Logic 54(3), 921\u2013927 (1989)","journal-title":"J. Symbol. Logic"},{"key":"19_CR48","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/2274335","volume":"50","author":"K McEvoy","year":"1985","unstructured":"McEvoy, K.: Jumps of quasi-minimal enumeration degrees. J. Symbol. Logic 50, 839\u2013848 (1985)","journal-title":"J. Symbol. Logic"},{"key":"19_CR49","first-page":"501","volume":"104","author":"IT Medvedev","year":"1955","unstructured":"Medvedev, I.T.: Degrees of difficulty of the mass problem. Dokl. Nauk. SSSR 104, 501\u2013504 (1955)","journal-title":"Dokl. Nauk. SSSR"},{"key":"19_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-03073-4_38","volume-title":"Mathematical Theory and Computational Practice","author":"A Montalb\u00e1n","year":"2009","unstructured":"Montalb\u00e1n, A.: Notes on the jump of a structure. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 372\u2013378. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03073-4_38"},{"key":"19_CR51","doi-asserted-by":"publisher","first-page":"3464","DOI":"10.1098\/rsta.2011.0333","volume":"370","author":"A Montalb\u00e1n","year":"2012","unstructured":"Montalb\u00e1n, A.: Rice sequences of relations. Philos. Trans. R. Soc. A 370, 3464\u20133487 (2012)","journal-title":"Philos. Trans. R. Soc. A"},{"key":"19_CR52","unstructured":"Montalb\u00e1n, A.: Computable Structure Theory, draft"},{"key":"19_CR53","unstructured":"Montague, R.: Recursion theory as a branch of model theory. In: Proceedings of the Third International Congress for Logic Methodology and Philosophy of Science, pp. 63\u201386. North-Holland, Amsterdam-London (1967)"},{"key":"19_CR54","first-page":"427","volume":"138","author":"YN Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract first order computability I. Trans. Am. Math. Soc. 138, 427\u2013464 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"19_CR55","volume-title":"Elementary Induction of Abstract Structures","author":"YN Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: Elementary Induction of Abstract Structures. North-Holland, Amsterdam (1974)"},{"key":"19_CR56","doi-asserted-by":"publisher","first-page":"605","DOI":"10.2307\/2270854","volume":"34","author":"YN Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract computability and invariant definability. J. Symbol. Logic 34, 605\u2013633 (1969)","journal-title":"J. Symbol. Logic"},{"key":"19_CR57","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0002-9939-1961-0125794-X","volume":"12","author":"J Myhill","year":"1961","unstructured":"Myhill, J.: A note on the degrees of partial functions. Proc. Am. Math. Soc. 12, 519\u2013521 (1961)","journal-title":"Proc. Am. Math. Soc."},{"key":"19_CR58","unstructured":"Platek, R.: Foundations of recursion theory. Ph.D. thesis, Stanford University (1966)"},{"key":"19_CR59","unstructured":"Plotkin, G.D.: A set-theoretical definition of application Memorandum MIP-R-95. University of Edinburgh, School of Artificial Intelligence (1972)"},{"key":"19_CR60","unstructured":"Richter, L.J.: Degrees of unsolvability of models. Ph.D. dissertation, University of Illinois, Urbana-Champaign (1977)"},{"key":"19_CR61","doi-asserted-by":"publisher","first-page":"723","DOI":"10.2307\/2273222","volume":"46","author":"LJ Richter","year":"1981","unstructured":"Richter, L.J.: Degrees of structures. J. Symbol. Logic 46, 723\u2013731 (1981)","journal-title":"J. Symbol. Logic"},{"key":"19_CR62","unstructured":"Rozinas, M.: The semi-lattice of e-degrees. In: Recursive functions (Ivanovo), pp. 71\u201384. Ivano. Gos. Univ. (1978). (Russian)"},{"key":"19_CR63","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1090\/pspum\/013.1\/0276079","volume":"17","author":"GE Sacks","year":"1971","unstructured":"Sacks, G.E.: Forcing with perfect closed sets. Proc. Symp. Pure Math. 17, 331\u2013355 (1971)","journal-title":"Proc. Symp. Pure Math."},{"key":"19_CR64","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/malq.19710170139","volume":"17","author":"AL Selman","year":"1971","unstructured":"Selman, A.L.: Arithmetical reducibilities I. Z. Math. Logik Grundlag. Math. 17, 335\u2013350 (1971)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"19_CR65","doi-asserted-by":"crossref","unstructured":"Shepherdson, J.C.: Computation over abstract structures. In: Rose, H.E., Shepherdson, J.C. (eds.) Logic Colloquium-73, pp. 445\u2013513. North-Holland, Amsterdam (1975)","DOI":"10.1016\/S0049-237X(08)71963-3"},{"key":"19_CR66","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-2636-6","volume-title":"Computability in Combinatory Spaces","author":"DG Skordev","year":"1992","unstructured":"Skordev, D.G.: Computability in Combinatory Spaces. Kluwer Academic Publishers, Dordrecht-Boston-London (1992)"},{"key":"19_CR67","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1090\/S0002-9939-98-04307-X","volume":"126","author":"TA Slaman","year":"1998","unstructured":"Slaman, T.A.: Relative to any nonrecursive set. Proc. Am. Math. Soc. 126, 2117\u20132122 (1998)","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"19_CR68","first-page":"79","volume":"174","author":"TA Slaman","year":"1998","unstructured":"Slaman, T.A., Sorbi, A.: Quasi-minimal enumeration degrees and minimal Turing degrees. Annali di Matematica 174(4), 79\u201388 (1998)","journal-title":"Annali di Matematica"},{"key":"19_CR69","doi-asserted-by":"publisher","first-page":"428","DOI":"10.2307\/2274858","volume":"54","author":"IN Soskov","year":"1989","unstructured":"Soskov, I.N.: Definability via enumerations. J. Symbol. Logic 54, 428\u2013440 (1989)","journal-title":"J. Symbol. Logic"},{"key":"19_CR70","first-page":"89","volume":"83","author":"IN Soskov","year":"1989","unstructured":"Soskov, I.N.: An external characterization of the Prime computability. Ann. Univ. Sofia Fac. Math. Inf. 83, 89\u2013111 (1989)","journal-title":"Ann. Univ. Sofia Fac. Math. Inf."},{"key":"19_CR71","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01621094","volume":"29","author":"IN Soskov","year":"1990","unstructured":"Soskov, I.N.: Computability by means of effectively definable schemes and definability via enumerations. Arch. Math. Logic 29, 187\u2013200 (1990)","journal-title":"Arch. Math. Logic"},{"key":"19_CR72","first-page":"101","volume":"91","author":"IN Soskov","year":"1997","unstructured":"Soskov, I.N.: Constructing minimal pairs of degrees. Ann. Univ. Sofia 91, 101\u2013112 (1997)","journal-title":"Ann. Univ. Sofia"},{"key":"19_CR73","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s001530050156","volume":"39","author":"IN Soskov","year":"2000","unstructured":"Soskov, I.N.: A jump inversion theorem for the enumeration jump. Arch. Math. Logic 39, 417\u2013437 (2000)","journal-title":"Arch. Math. Logic"},{"key":"19_CR74","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.2178\/jsl\/1190150287","volume":"67","author":"IN Soskov","year":"2002","unstructured":"Soskov, I.N., Baleva, V.: Regular enumerations. J. Symbol. Logic 67, 1323\u20131343 (2002)","journal-title":"J. Symbol. Logic"},{"key":"19_CR75","first-page":"45","volume":"96","author":"IN Soskov","year":"2004","unstructured":"Soskov, I.N.: Degree spectra and co-spectra of structures. Ann. Univ. Sofia 96, 45\u201368 (2004)","journal-title":"Ann. Univ. Sofia"},{"key":"19_CR76","doi-asserted-by":"crossref","unstructured":"Soskov, I.N., Baleva, V.: Ash\u2019s theorem for abstract structures. In: Chatzidakis, Z., Koepke, P., Pohlers, W. (eds.) Logic Colloquium 2002, Muenster, Germany, pp. 327\u2013341. Association for Symbolic Logic (2006)","DOI":"10.1017\/9781316755723.015"},{"issue":"5","key":"19_CR77","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1017\/S0960129506005639","volume":"16","author":"IN Soskov","year":"2006","unstructured":"Soskov, I.N., Kovachev, B.: Uniform regular enumerations. Math. Struct. Comput. Sci. 16(5), 901\u2013924 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"19_CR78","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1093\/logcom\/exm041","volume":"17","author":"IN Soskov","year":"2007","unstructured":"Soskov, I.N.: The $$\\omega $$-enumeration degrees. J. Logic Comput. 17, 1193\u20131217 (2007)","journal-title":"J. Logic Comput."},{"issue":"4","key":"19_CR79","first-page":"637","volume":"5","author":"I Soskov","year":"2011","unstructured":"Soskov, I., Soskova, M.: Kalimullin pairs of $$\\Sigma ^0_2$$ omega-enumeration degrees. Int. J. Softw. Inf. 5(4), 637\u2013658 (2011)","journal-title":"Int. J. Softw. Inf."},{"key":"19_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-39053-1_43","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"IN Soskov","year":"2013","unstructured":"Soskov, I.N.: A note on $$\\omega $$-jump inversion of degree spectra of structures. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 365\u2013370. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39053-1_43"},{"issue":"6","key":"19_CR81","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1093\/logcom\/ext041","volume":"23","author":"IN Soskov","year":"2013","unstructured":"Soskov, I.N.: Effective properties of Marker\u2019s extensions. J. Logic Comput. 23(6), 1335\u20131367 (2013). doi:10.1093\/logcom\/ext041","journal-title":"J. Logic Comput."},{"key":"19_CR82","first-page":"35","volume":"96","author":"AA Soskova","year":"2004","unstructured":"Soskova, A.A., Soskov, I.N.: Co-spectra of joint spectra of structures. Ann. Sofia Univ. Fac. Math. Inf. 96, 35\u201344 (2004)","journal-title":"Ann. Sofia Univ. Fac. Math. Inf."},{"key":"19_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/11494645_56","volume-title":"New Computational Paradigms","author":"AA Soskova","year":"2005","unstructured":"Soskova, A.A.: Minimal pairs and quasi-minimal degrees for the joint spectra of structures. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 451\u2013460. Springer, Heidelberg (2005). doi:10.1007\/11494645_56"},{"key":"19_CR84","first-page":"15","volume":"97","author":"AA Soskova","year":"2005","unstructured":"Soskova, A.A.: Properties of co-spectra of joint spectra of structures. Ann. Sofia Univ. Fac. Math. Inf. 97, 15\u201332 (2005)","journal-title":"Ann. Sofia Univ. Fac. Math. Inf."},{"key":"19_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/11780342_56","volume-title":"Logical Approaches to Computational Barriers","author":"AA Soskova","year":"2006","unstructured":"Soskova, A.A.: Relativized degree spectra. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 546\u2013555. Springer, Heidelberg (2006). doi:10.1007\/11780342_56"},{"key":"19_CR86","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1093\/logcom\/exm043","volume":"17","author":"AA Soskova","year":"2007","unstructured":"Soskova, A.A.: Relativized degree spectra. J. Logic Comput. 17, 1215\u20131234 (2007)","journal-title":"J. Logic Comput."},{"key":"19_CR87","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-540-73001-9_76","volume-title":"Computation and Logic in the Real World","author":"AA Soskova","year":"2007","unstructured":"Soskova, A.A.: A jump inversion theorem for the degree spectra. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 716\u2013726. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-73001-9_76"},{"key":"19_CR88","unstructured":"Soskova, A.A., Soskov, I.N.: Jump spectra of abstract structures. In: Proceeding of the 6th Panhellenic Logic Symposium, Volos, Greece, pp. 114\u2013117 (2007)"},{"key":"19_CR89","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-69407-6_58","volume-title":"Logic and Theory of Algorithms","author":"AA Soskova","year":"2008","unstructured":"Soskova, A.A.: $$\\omega $$-degree spectra. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 544\u2013553. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69407-6_58"},{"key":"19_CR90","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1093\/logcom\/exn024","volume":"19","author":"AA Soskova","year":"2009","unstructured":"Soskova, A.A., Soskov, I.N.: A jump inversion theorem for the degree spectra. J. Logic Comput. 19, 199\u2013215 (2009)","journal-title":"J. Logic Comput."},{"issue":"2","key":"19_CR91","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1093\/logcom\/ext045","volume":"23","author":"A Soskova","year":"2013","unstructured":"Soskova, A., Soskov, I.N.: Quasi-minimal degrees for degree spectra. J. Logic Comput. 23(2), 1319\u20131334 (2013). doi:10.1093\/logcom\/ext045","journal-title":"J. Logic Comput."},{"issue":"4","key":"19_CR92","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1093\/logcom\/exq051","volume":"22","author":"M Soskova","year":"2012","unstructured":"Soskova, M., Soskov, I.: Embedding countable partial orderings in the enumeration degrees and the omega enumeration degrees. J. Logic Comput. 22(4), 927\u2013952 (2012). doi:10.1093\/logcom\/exq051. First published online October 23, 2010","journal-title":"J. Logic Comput."},{"key":"19_CR93","unstructured":"Stukachev, A.I.: A jump inversion theorem for semilattices of $$\\Sigma $$-degrees. Sib. $$\\grave{E}$$lektron. Mat. Izv. 6, 182\u2013190 (2009)"},{"issue":"1","key":"19_CR94","doi-asserted-by":"publisher","first-page":"68","DOI":"10.3103\/S1055134410010037","volume":"20","author":"AI Stukachev","year":"2010","unstructured":"Stukachev, A.I.: A jump inversion theorem for the semilattices of Sigma-degrees. Siberian Adv. Math. 20(1), 68\u201374 (2010)","journal-title":"Siberian Adv. Math."},{"key":"19_CR95","doi-asserted-by":"crossref","unstructured":"Stukachev, A.I.: Effective model theory: an approach via $$\\Sigma $$-definability. In: Greenberg, N., Hamkins, J.D., Hirschfeldt, D., Miller, R. (eds.) Effective Mathematics of the Uncountable. Lecture Notes in Logic, vol. 41, pp. 164\u2013197 (2013)","DOI":"10.1017\/CBO9781139028592.010"},{"key":"19_CR96","unstructured":"Vatev, S.: Omega spectra and co-spectra of structures. Master thesis, Sofia University (2008)"},{"key":"19_CR97","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-21875-0_32","volume-title":"Models of Computation in Context","author":"S Vatev","year":"2011","unstructured":"Vatev, S.: Conservative extensions of abstract structures. In: L\u00f6we, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 300\u2013309. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21875-0_32"},{"key":"19_CR98","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-39053-1_49","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"S Vatev","year":"2013","unstructured":"Vatev, S.: Another jump inversion theorem for structures. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 414\u2013423. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39053-1_49"},{"key":"19_CR99","unstructured":"Vatev, S.: Effective properties of structures in the hyperarithmetical hierarchy. Ph.D. thesis, Sofia University (2014)"},{"key":"19_CR100","first-page":"171","volume":"102","author":"S Vatev","year":"2015","unstructured":"Vatev, S.: On the notion of jump structure. Ann. Sofia Univ. Fac. Math. Inf. 102, 171\u2013206 (2015)","journal-title":"Ann. Sofia Univ. Fac. Math. Inf."},{"key":"19_CR101","doi-asserted-by":"crossref","unstructured":"Wehner, St.: Enumerations, countable structures and turing degrees. Proc. Am. Math. Soc. 126, 2131\u20132139 (1998)","DOI":"10.1090\/S0002-9939-98-04314-7"}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50062-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:56:47Z","timestamp":1709830607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50062-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,1]]},"ISBN":["9783319500614","9783319500621"],"references-count":101,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50062-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,1]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}