{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:00:41Z","timestamp":1775462441661,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T00:00:00Z","timestamp":1127779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T00:00:00Z","timestamp":1127779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s00153-004-0245-z","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T12:17:55Z","timestamp":1127823475000},"page":"249-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["The jump operation for structure degrees"],"prefix":"10.1007","volume":"45","author":[{"given":"V.","family":"Baleva","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,27]]},"reference":[{"key":"245_CR1","unstructured":"Angelov, I.: Enumerable relations of structure degrees coding. Master's thesis, Sofia University, 1999 (in Bulgarian)"},{"key":"245_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2000633","volume":"298","author":"Ash","year":"1986","unstructured":"Ash, C.J.: Recursive labeling systems and stability of recursive structures in hyperarithmetical degrees. Trans. Amer. Math. Soc. 298, 497\u2013514 (1986)","journal-title":"Trans. Amer. Math. Soc."},{"key":"245_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0168-0072(92)90026-V","volume":"58","author":"Ash","year":"1992","unstructured":"Ash, C.J.: Generalizations of enumeration reducibility using recursive infinitary propositional sentences. Ann. Pure Appl. Logic 58, 173\u2013184 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"245_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.2307\/2001255","volume":"319","author":"Ash","year":"1990","unstructured":"Ash, C.J., Jockusch, C., Knight, J.F.: Jumps of orderings. Trans. Amer. Math. Soc. 319, 573\u2013599 (1990)","journal-title":"Trans. Amer. Math. Soc."},{"key":"245_CR5","first-page":"39","volume":"93","author":"Baleva","year":"1999","unstructured":"Baleva, V.: Regular enumerations for abstract structures. Ann. Univ. Sofia 93, 39\u201348 (1999)","journal-title":"Ann. Univ. Sofia"},{"key":"245_CR6","unstructured":"Baleva, V.: Structure degree jump. PhD thesis, Sofia University, 2001 (in Bulgarian)"},{"key":"245_CR7","unstructured":"Bouchkova, V.: Relative set genericity. To appear in Ann. Univ. Sofia, 2002"},{"key":"245_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/malq.19740201311","volume":"20","author":"Case","year":"1974","unstructured":"Case, J.: Maximal arithmetical reducibilities. Z. Math. Logik Grundlag. Math. 20, 261\u2013270 (1974)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"245_CR9","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1112\/S0024610700001459","volume":"62","author":"Coles","year":"2","unstructured":"Coles, R., Downey, R., Slaman, T.: Every set has a least jump enumeration. Journal of London Math. Soc. 62 (2), 641\u2013649 (2000)","journal-title":"Journal of London Math. Soc."},{"key":"245_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.2307\/2274181","volume":"49","author":"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 49, 503\u2013513 (1984)","journal-title":"J. Symbolic Logic"},{"key":"245_CR11","doi-asserted-by":"crossref","unstructured":"Cooper, S.B.: Enumeration reducibilty, nondeterministic computations and relative computability of partial functions. In: Ambos-Spies, K., Muler, G., Sacks, G.E. (eds), Recursion theory week, Oberwolfach 1989, vol. 1432 of Lecture notes in mathematics, Heidelberg, Springer-Verlag, 1990, pp 57\u2013110,","DOI":"10.1007\/BFb0086114"},{"key":"245_CR12","doi-asserted-by":"crossref","unstructured":"Downey, R.: Computability, definability and algebraic structures. In: Decheng D., et al., (ed), Proceedings of 7th and 8th Asian logic conference. World Scientific, 2003","DOI":"10.1142\/9789812705815_0004"},{"key":"245_CR13","doi-asserted-by":"publisher","first-page":"545","DOI":"10.2307\/2159679","volume":"114","author":"Downey","year":"1992","unstructured":"Downey, R.G., Knight, J.F.: Orderings with \u03b1-th jump degree 0(\n                           \n                    \u03b1\n                  \n                           ). Proc. Amer. Math. Soc. 114, 545\u2013552 (1992)","journal-title":"Proc. Amer. Math. Soc."},{"key":"245_CR14","unstructured":"Jojgov, G.: Minimal pairs of structure degrees. Master's thesis, Sofia University, 1997 (in Bulgarian)"},{"key":"245_CR15","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.2307\/2273915","volume":"51","author":"Knight","year":"1986","unstructured":"Knight, J.F.: Degrees coded in jumps of orderings. J. Symbolic Logic 51, 1034\u20131042 (1986)","journal-title":"J. Symbolic Logic"},{"key":"245_CR16","first-page":"3410","volume":"258","author":"Lacombe","year":"1964","unstructured":"Lacombe, D.: Deux g\u00e9n\u00e9ralisations de la notion de recursivit\u00e9 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"},{"key":"245_CR17","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/2274335","volume":"50","author":"McEvoy","year":"1985","unstructured":"McEvoy, K.: Jumps of quasi-minimal enumeration degrees. J. Symbolic Logic 50, 839\u2013848 (1985)","journal-title":"J. Symbolic Logic"},{"key":"245_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.2307\/1994926","volume":"138","author":"Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract first order computability I. Trans. Amer. Math. Soc. 138, 427\u2013464 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"245_CR19","doi-asserted-by":"publisher","first-page":"465","DOI":"10.2307\/1994927","volume":"138","author":"Moschovakis","year":"1969","unstructured":"Moschovakis, Y.N.: Abstract first order computability II. Trans. Amer. Math. Soc. 138, 465\u2013504 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"245_CR20","unstructured":"Odifreddi, P.G.: Classical recursion theory. volume II. North\u2013Holland, 1999"},{"key":"245_CR21","doi-asserted-by":"publisher","first-page":"723","DOI":"10.2307\/2273222","volume":"46","author":"Richter","year":"1981","unstructured":"Richter, L.J.: Degrees of structures. J. Symbolic Logic 46, 723\u2013731 (1981)","journal-title":"J. Symbolic Logic"},{"key":"245_CR22","unstructured":"Rogers, Jr. H.: Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York, 1967"},{"key":"245_CR23","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/malq.19710170139","volume":"17","author":"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":"245_CR24","unstructured":"Shoenfield, J.R.: Mathematical logic. Addison-Wesley Publishing Company, 1967"},{"key":"245_CR25","doi-asserted-by":"crossref","unstructured":"Skordev, D.G.: Computability in combinatory spaces. Kluwer Academic Publishers, Dordrecht \u2013 Boston \u2013 London, 1992","DOI":"10.1007\/978-94-011-2636-6"},{"key":"245_CR26","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s001530050156","volume":"39","author":"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":"245_CR27","unstructured":"Soskov, I.N.: Abstract computability and definability. Doctor habil. thesis, Sofia University, 2001 (in Bulgarian)"},{"key":"245_CR28","unstructured":"Soskov, I.N.: Degree spectra and co-spectra of structures. To appear in Ann. Univ. Sofia, 2003"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-004-0245-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-004-0245-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-004-0245-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-004-0245-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:03:23Z","timestamp":1652486603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-004-0245-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,27]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["245"],"URL":"https:\/\/doi.org\/10.1007\/s00153-004-0245-z","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,27]]},"assertion":[{"value":"25 June 2003","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}