{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:53:49Z","timestamp":1725886429614},"publisher-location":"Cham","reference-count":68,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436678"},{"type":"electronic","value":"9783319436692"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-43669-2_2","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T02:14:07Z","timestamp":1493950447000},"page":"11-46","source":"Crossref","is-referenced-by-count":0,"title":["Ivan Soskov: A Life in Computability"],"prefix":"10.1007","author":[{"given":"Hristo","family":"Ganchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimiter","family":"Skordev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"key":"2_CR1","unstructured":"C.\u00a0Bianchini, Bounding Enumeration Degrees, Ph.D. thesis, University of Siena, 2000"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1112\/S0024610700001459","volume":"62","author":"R. Coles","year":"1998","unstructured":"R. Coles, R. Downey, T. Slaman, Every set has a least jump enumeration. J. Lond. Math. Soc. 62, 641\u2013649 (1998)","journal-title":"J. Lond. Math. Soc."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"S.B. Cooper, Partial degrees and the density problem. Part 2: The enumeration degrees of the $$\\Sigma _{2}$$ sets are dense. J. Symb. Log. 49, 503\u2013513 (1984)","DOI":"10.2307\/2274181"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"A.P. Ershov, Abstract computability on algebraic structures, in Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol.\u00a0122 (Springer, Berlin, 1981), pp.\u00a0397\u2013420","DOI":"10.1007\/3-540-11157-3_38"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2307\/2964177","volume":"22","author":"R.M. Friedberg","year":"1957","unstructured":"R.M. Friedberg, A criterion for completeness of degrees of unsolvability. J. Symb. Log. 22, 159\u2013160 (1957)","journal-title":"J. Symb. Log."},{"key":"2_CR6","first-page":"361","volume-title":"Logic Colloquium\u201969","author":"H. Friedman","year":"1971","unstructured":"H. Friedman, Algorithmic procedures, generalized Turing algorithms and elementary recursion theory, in Logic Colloquium\u201969, ed. by R.O. Gandy, C.E.M. Yates (North-Holland, Amsterdam, 1971), pp.\u00a0361\u2013389"},{"issue":"9","key":"2_CR7","first-page":"1512","volume":"65","author":"H. Ganchev","year":"2014","unstructured":"H. Ganchev, A.C. Sariev, The \u03c9-Turing degrees. Ann. Pure Appl. Log. 65 (9), 1512\u20131532 (2014)","journal-title":"Ann. Pure Appl. Log."},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.apal.2009.01.003","volume":"160","author":"H. Ganchev","year":"2009","unstructured":"H.\u00a0Ganchev, I.N. Soskov, The jump operator on the \u03c9-enumeration degrees. Ann. Pure Appl. Log. 160 (3), 289\u2013301 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.apal.2010.10.004","volume":"163","author":"H. Ganchev","year":"2012","unstructured":"H. Ganchev, M.I. Soskova, The high\/low hierarchy in the local structure of the \u03c9-enumeration degrees. Ann. Pure Appl. Log. 163, 547\u2013566 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1093\/logcom\/exq042","volume":"22","author":"H. Ganchev","year":"2012","unstructured":"H. Ganchev, M.I. Soskova, Embedding distributive lattices in the $$\\Sigma _{2}^{0}$$ enumeration degrees. J.\u00a0Log. Comput. 22, 779\u2013792 (2012)","journal-title":"J. Log. Comput."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.2178\/jsl\/1327068696","volume":"77","author":"H. Ganchev","year":"2012","unstructured":"H. Ganchev, M.I. Soskova, Cupping and definability in the local structure of the enumeration degrees. J. Symb. Log. 77, 133\u2013158 (2012)","journal-title":"J. Symb. Log."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.2178\/jsl.7704070","volume":"77","author":"H. Ganchev","year":"2012","unstructured":"H. Ganchev, M.I. Soskova, Interpreting true arithmetic in the local structure of the enumeration degrees. J. Symb. Log. 77, 1184\u20131194 (2012)","journal-title":"J. Symb. Log."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"4873","DOI":"10.1090\/S0002-9947-2014-06157-6","volume":"367","author":"H. Ganchev","year":"2015","unstructured":"H. Ganchev, M.I. Soskova, Definability via Kalimullin pairs in the structure of the enumeration degrees. Trans. Am. Math. Soc. 367, 4873\u20134893 (2015)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"S.S. Goncharov, V.S. Harizanov, J.F. Knight, R.A. Shore, $$\\Pi _{1}^{1}$$ relations and paths through $$\\mathcal{O}$$ .\u00a0J.\u00a0Symb. Log. 69, 585\u2013611 (2004)","DOI":"10.2178\/jsl\/1082418544"},{"key":"2_CR15","first-page":"391","volume":"197","author":"C.E. Gordon","year":"1974","unstructured":"C.E. Gordon, Prime and search computability characterized as definability in certain sublanguages of constructible $$L_{\\omega _{1},\\omega }$$ . Trans. Am. Math. Soc. 197, 391\u2013407 (1974)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1142\/S0219061303000285","volume":"3","author":"I.S. Kalimullin","year":"2003","unstructured":"I.S. Kalimullin, Definability of the jump operator in the enumeration degrees. J. Math. Log. 3, 257\u2013267 (2003)","journal-title":"J. Math. Log."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.2307\/2273915","volume":"51","author":"J.F. Knight","year":"1986","unstructured":"J.F. Knight, Degrees coded in jumps of orderings. J. Symb. Log. 51, 1034\u20131042 (1986)","journal-title":"J. Symb. Log."},{"key":"2_CR18","first-page":"3410","volume":"258","author":"D. Lacombe","year":"1964","unstructured":"D. Lacombe, Deux g\u00e9n\u00e9ralisations de la notion de r\u00e9cursivit\u00e9 relative. C. R. Acad. Sci. Paris 258, 3410\u20133413 (1964)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/2274335","volume":"50","author":"K. McEvoy","year":"1985","unstructured":"K. McEvoy, Jumps of quasi-minimal enumeration degrees. J. Symb. Log. 50, 839\u2013848 (1985)","journal-title":"J. Symb. Log."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"983","DOI":"10.2307\/2273985","volume":"50","author":"K. McEvoy","year":"1985","unstructured":"K. McEvoy, S.B. Cooper, On minimal pairs of enumeration degrees. J. Symb. Log. 50, 983\u20131001 (1985)","journal-title":"J. Symb. Log."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-03073-4_38","volume-title":"Notes on the jump of a structure, in Mathematical Theory and Computational Practice","author":"A. Montalban","year":"2009","unstructured":"A. Montalban, Notes on the jump of a structure, in Mathematical Theory and Computational Practice (Springer, Berlin, 2009), pp.\u00a0372\u2013378"},{"key":"2_CR22","first-page":"427","volume":"138","author":"Y.N. Moschovakis","year":"1969","unstructured":"Y.N. Moschovakis, Abstract first order computability. I. Trans. Am. Math. Soc. 138, 427\u2013464 (1969)","journal-title":"I. Trans. Am. Math. Soc."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"605","DOI":"10.2307\/2270854","volume":"34","author":"Y.N. Moschovakis","year":"1969","unstructured":"Y.N. Moschovakis, Abstract computability and invariant definability. J. Symb. Log. 34, 605\u2013633 (1969)","journal-title":"J. Symb. Log."},{"key":"2_CR24","volume-title":"Elementary Induction on Abstract Structures","author":"Y.N. Moschovakis","year":"1974","unstructured":"Y.N. Moschovakis, Elementary Induction on Abstract Structures (North-Holland, Amsterdam, 1974)"},{"key":"2_CR25","first-page":"267","volume-title":"Programming Theory. Proceedings of a Symposium (Novosibirsk, 7\u201311 Aug 1972), Part 1","author":"V.A. Nepomniaschy","year":"1972","unstructured":"V.A. Nepomniaschy, Criteria for the algorithmic completeness of systems of operations, in Programming Theory. Proceedings of a Symposium (Novosibirsk, 7\u201311 Aug 1972), Part 1, ed. by V.A.\u00a0Nepomnyaschy (Computer Centre of the Siberian Branch of the Soviet Academy of Sciences, Novosibirsk, 1972), pp. 267\u2013279 [in Russian]"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"723","DOI":"10.2307\/2273222","volume":"46","author":"L.J. Richter","year":"1981","unstructured":"L.J. Richter, Degrees of Structures. J. Symb. Log. 46, 723\u2013731 (1981)","journal-title":"Degrees of Structures. J. Symb. Log."},{"key":"2_CR27","volume-title":"Degrees of Unsolvability","author":"G.E. Sacks","year":"1963","unstructured":"G.E. Sacks, Degrees of Unsolvability (Princeton University Press, Princeton, 1963)"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1305\/ndjfl\/1093888400","volume":"19","author":"L.E. Sanchis","year":"1978","unstructured":"L.E. Sanchis, Hyperenumeration reducibility. Notre Dame J. Formal Logic 19, 405\u2013415 (1978)","journal-title":"Notre Dame J. Formal Logic"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.2307\/2273730","volume":"44","author":"L.E. Sanchis","year":"1979","unstructured":"L.E. Sanchis, Reducibilities in two models of combinatory logic. J. Symb. Log. 44, 221\u2013234 (1979)","journal-title":"J. Symb. Log."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/malq.19710170139","volume":"17","author":"A.L. Selman","year":"1971","unstructured":"A.L. Selman, Arithmetical reducibilities I. Z. Math. Logik Grundlag. Math. 17, 335\u2013350 (1971)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"2_CR31","first-page":"445","volume-title":"Logic Colloquium\u201973","author":"J.C. Shepherdson","year":"1975","unstructured":"J.C. Shepherdson, Computation over abstract structures, in Logic Colloquium\u201973, ed. by H.E. Rose, J.C. Shepherdson (North-Holland, Amsterdam, 1975), pp.\u00a0445\u2013513"},{"key":"2_CR32","volume-title":"Combinatory spaces and recursiveness in them","author":"D. Skordev","year":"1980","unstructured":"D. Skordev, Combinatory spaces and recursiveness in them (Publisher House of the Bulgarian Academy of Science, Sofia 1980) [in Russian]"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"D. Skordev, Computability in Combinatory Spaces. An Algebraic Generalization of Abstract First Order Computability (Kluwer Academic Publishers, Dordrecht, 1992)","DOI":"10.1007\/978-94-011-2636-6"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01759368","volume":"174","author":"T.A. Slaman","year":"1998","unstructured":"T.A. Slaman, A. Sorbi, Quasi-minimal enumeration degrees and minimal Turing degrees. Mat. Pura Appl. 174, 97\u2013120 (1998)","journal-title":"Mat. Pura Appl."},{"key":"2_CR35","volume-title":"Prime computable functions of finitely many arguments with argument and function values in the basic set","author":"I.N. Soskov","year":"1979","unstructured":"I.N. Soskov, Prime computable functions of finitely many arguments with argument and function values in the basic set. M.Sc. thesis, Sofia University, 1979 [in Bulgarian]"},{"key":"2_CR36","unstructured":"I.N. Soskov, Prime computable functions in the basic set, in Mathematical Logic. Proceedings of the Conference on Mathematical Logic. Dedicated to the memory of A.A. Markov (1903\u20131979), (Sofia, 22\u201323 Sept 1980) ed. by D. Skordev (Publishers House of the Bulgarian Academy of Sciences, Sofia, 1984), pp.\u00a0112\u2013138 [in Russian]"},{"key":"2_CR37","first-page":"26","volume-title":"Mathematical Theory and Practice of Program Systems","author":"I.N. Soskov","year":"1982","unstructured":"I.N. Soskov, An example of a basis which is Moschovakis complete without being program complete, in Mathematical Theory and Practice of Program Systems, ed. by A.P. Ershov (Computer Centre of the Siberian Branch of the Soviet Academy of Sciences, Novosibirsk, 1982), pp.\u00a026\u201333 [in Russian]"},{"key":"2_CR38","unstructured":"I.N. Soskov, Computability in algebraic systems. C.R. Acad. Bulg. Sci. 36, 301\u2013304 (1983) [in Russian]"},{"key":"2_CR39","first-page":"729","volume":"36","author":"I.N. Soskov","year":"1983","unstructured":"I.N. Soskov, Algorithmically complete algebraic systems, C. R. Acad. Bulg. Sci. 36, 729\u2013731 (1983) [in Russian]","journal-title":"C. R. Acad. Bulg. Sci."},{"key":"2_CR40","unstructured":"I.N. Soskov, Computability over partial algebraic systems. Ph.D. thesis, Sofia University, 1983 [in Bulgarian]"},{"key":"2_CR41","unstructured":"I.N. Soskov, The connection between prime computability and recursiveness in functional combinatory spaces, in Mathematical Theory of Programming, ed. by A.P. Ershov, D. Skordev. Computer Centre of the Siberian Branch of the Soviet Academy of Sciences, Novosibirsk, 1985, pp.\u00a04\u201311 [in Russian]"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"I.N. Soskov, Prime computability on partial structures, in Mathematical Logic and its Applications. Proceedings of an Advanced International Summer School and Conference on Mathematical Logic and Its Applications in honor of the 80th anniversary of Kurt G\u00f6del\u2019s birth (Druzhba, Bulgaria, 24 Sept\u20134 Oct 1986) ed. by D.\u00a0Skordev (Plenum Press, New York, 1987), pp.\u00a0341\u2013350","DOI":"10.1007\/978-1-4613-0897-3_26"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"428","DOI":"10.2307\/2274858","volume":"54","author":"I.N. Soskov","year":"1989","unstructured":"I.N. Soskov, Definability via enumerations. J. Symb. Log. 54, 428\u2013440 (1989)","journal-title":"J. Symb. Log."},{"key":"2_CR44","unstructured":"I.N. Soskov, An external characterization of the prime computability. Ann. Univ. Sofia 83, livre 1 \u2013 Math. 89\u2013111 (1989)"},{"key":"2_CR45","unstructured":"I.N. Soskov, Maximal concepts of computability and maximal programming languages, Technical Report, Contract no.\u00a0247\/1987 with the Ministry of Culture, Science and Education, Laboratory for Applied Logic, Sofia University (1989)"},{"key":"2_CR46","unstructured":"I.N. Soskov, Horn clause programs on abstract structures with parameters (extended abstract). Ann. Univ. Sofia 84, livre 1 \u2013 Math. 53\u201361 (1990)"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"I.N. Soskov, On the computational power of the logic programs, in Mathematical Logic. Proceedings of the Summer School and Conference on Math. Logic, honourably dedicated to the 90th anniversary of Arend Heyting (1898\u20131980) (Chaika (near Varna), Bulgaria, 13\u201323 Sept 1988) ed. by P.\u00a0Petkov (Plenum Press, New York, 1990), pp.\u00a0117\u2013137","DOI":"10.1007\/978-1-4613-0609-2_10"},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"I.N. Soskov, Computability by means of effectively definable schemes and definability via enumerations. J. Symb. Log. 55, 430\u2013431 (1990) [abstract]","DOI":"10.1007\/BF01621094"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01621094","volume":"29","author":"I.N. Soskov","year":"1990","unstructured":"I.N. Soskov, Computability by means of effectively definable schemes and definability via enumerations. Arch. Math. Logic 29, 187\u2013200 (1990)","journal-title":"Arch. Math. Logic"},{"key":"2_CR50","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/malq.19910370206","volume":"37","author":"I.N. Soskov","year":"1991","unstructured":"I.N. Soskov, Second order definability via enumerations. Zeitschr. f. math Logik und Grundlagen d. Math. 37, 45\u201354 (1991)","journal-title":"Zeitschr. f. math Logik und Grundlagen d. Math."},{"key":"2_CR51","unstructured":"I.N. Soskov, Maximal concepts of computability on abstract structures. J. Symb. Log. 57, 337\u2013338 (1992) [abstract]"},{"key":"2_CR52","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/malq.19960420110","volume":"42","author":"I.N. Soskov","year":"1996","unstructured":"I.N. Soskov, Intrinsically $$\\Pi _{1}^{1}$$ -relations. Math. Log. Q. 42, 109\u2013126 (1996)","journal-title":"Math. Log. Q."},{"key":"2_CR53","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/malq.19960420139","volume":"42","author":"I.N. Soskov","year":"1996","unstructured":"I.N. Soskov, Intrinsically hyperarithmetical sets. Math. Log. Q. 42, 469\u2013480 (1996)","journal-title":"Math. Log. Q."},{"key":"2_CR54","first-page":"101","volume":"88","author":"I.N. Soskov","year":"1997","unstructured":"I.N. Soskov, Constructing minimal pairs of degrees. Ann. Univ. Sofia 88, 101\u2013112 (1997)","journal-title":"Ann. Univ. Sofia"},{"key":"2_CR55","volume-title":"Abstract computability and definability: external approach","author":"I.N. Soskov","year":"2000","unstructured":"I.N. Soskov, Abstract computability and definability: external approach. Dr. Hab. thesis, Sofia University, 2000 [in Bulgarian]"},{"key":"2_CR56","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s001530050156","volume":"39","author":"I.N. Soskov","year":"2000","unstructured":"I.N. Soskov, A jump inversion theorem for the enumeration jump. Arch. Math. Log. 39, 417\u2013437 (2000)","journal-title":"Arch. Math. Log."},{"key":"2_CR57","first-page":"45","volume":"96","author":"I.N. Soskov","year":"2004","unstructured":"I.N. Soskov, Degree spectra and co-spectra of structures. Ann. Univ. Sofia 96, 45\u201368 (2004)","journal-title":"Ann. Univ. Sofia"},{"key":"2_CR58","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1093\/logcom\/exm041","volume":"17","author":"I.N. Soskov","year":"2007","unstructured":"I.N. Soskov, The \u03c9-enumeration degrees. J. Log. Comput. 17, 1193\u20131214 (2007)","journal-title":"J. Log. Comput."},{"issue":"6","key":"2_CR59","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1093\/logcom\/ext041","volume":"23","author":"I.N. Soskov","year":"2013","unstructured":"I.N. Soskov, Effective properties of Marker\u2019s extensions. J. Log. Comput. 23 (6), 1335\u20131367 (2013)","journal-title":"J. Log. Comput."},{"key":"2_CR60","doi-asserted-by":"publisher","unstructured":"I.N. Soskov, A note on \u03c9-jump inversion of degree spectra of structures, in The Nature of Computation. Logic, Algorithms, Applications. Lecture Notes in Computer Science, vol.\u00a07921 (Springer, Berlin, 2013), pp.\u00a0365\u2013370","DOI":"10.1007\/978-3-642-39053-1_43"},{"key":"2_CR61","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.2178\/jsl\/1190150287","volume":"67","author":"I.N. Soskov","year":"2002","unstructured":"I.N. Soskov, V.\u00a0Baleva, Regular enumerations. J. Symb. Log. 67, 1323\u20131343 (2002)","journal-title":"J. Symb. Log."},{"issue":"5","key":"2_CR62","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1017\/S0960129506005639","volume":"16","author":"I. Soskov","year":"2006","unstructured":"I.\u00a0Soskov, B.\u00a0Kovachev, Uniform regular enumerations. Math. Struct. Comput. Sci. 16 (5), 901\u2013924 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR63","first-page":"637","volume":"5","author":"I.N. Soskov","year":"2011","unstructured":"I.N. Soskov, M.I. Soskova, Kalimullin pairs of $$\\Sigma _{2}^{0}$$ omega-enumeration degrees. J. Softw. Inf. 5, 637\u2013658 (2011)","journal-title":"J. Softw. Inf."},{"key":"2_CR64","doi-asserted-by":"publisher","unstructured":"A.A. Soskova, Minimal pairs and quasi-minimal degrees for the joint spectra of structures, in New Computational Paradigms. Lecture Notes in Computer Science, vol.\u00a03526 (Springer, Berlin, 2005), pp.\u00a0451\u2013460","DOI":"10.1007\/11494645_56"},{"key":"2_CR65","doi-asserted-by":"crossref","unstructured":"A.A. Soskova, I.N. Soskov, Effective enumerations of abstract structures, in Mathematical Logic. Proceedings of the Summer School and Conference on Mathematical Logic, honourably dedicated to the 90th anniversary of Arend Heyting (1898\u20131980) (Chaika (near Varna), Bulgaria, 13\u201323 Sept 1988) ed. by P.\u00a0Petkov (Plenum Press, New York, 1990), pp.\u00a0361\u2013372","DOI":"10.1007\/978-1-4613-0609-2_26"},{"key":"2_CR66","first-page":"35","volume":"96","author":"A.A. Soskova","year":"2004","unstructured":"A.A. Soskova, I.N. Soskov, 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":"2_CR67","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1093\/logcom\/exn024","volume":"19","author":"A.A. Soskova","year":"2009","unstructured":"A.A. Soskova, I.N. Soskov, A jump inversion theorem for the degree spectra. J. Log. Comput. 19, 199\u2013215 (2009)","journal-title":"J. Log. Comput."},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1093\/logcom\/exq051","volume":"22","author":"M.I. Soskova","year":"2012","unstructured":"M.I. Soskova, I.N. Soskov, Embedding countable partial orderings into the enumeration and \u03c9-enumeration degrees. J. Log. Comput. 22, 927\u2013952 (2012)","journal-title":"J. Log. Comput."}],"container-title":["Theory and Applications of Computability","The Incomputable"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43669-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T06:51:50Z","timestamp":1569221510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43669-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319436678","9783319436692"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43669-2_2","relation":{},"ISSN":["2190-619X","2190-6203"],"issn-type":[{"type":"print","value":"2190-619X"},{"type":"electronic","value":"2190-6203"}],"subject":[],"published":{"date-parts":[[2017]]}}}