{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T18:23:45Z","timestamp":1761157425023,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00153-022-00847-1","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T19:02:33Z","timestamp":1663354953000},"page":"401-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["$$sQ_1$$-degrees of computably enumerable sets"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0215-7912","authenticated-orcid":false,"given":"Roland Sh.","family":"Omanadze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,16]]},"reference":[{"key":"847_CR1","first-page":"239","volume":"13","author":"OV Belegradek","year":"1974","unstructured":"Belegradek, O.V.: Algebraically closed groups. Algebra i Logika 13, 239\u2013255 (1974). (in Russian)","journal-title":"Algebra i Logika"},{"issue":"4","key":"847_CR2","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1305\/ndjfl\/1040046145","volume":"37","author":"OV Belegradek","year":"1996","unstructured":"Belegradek, O.V.: Higman\u2019s embedding theorem in a general setting and its application to existentially closed algebras. Notre Dame J. Formal Logic 37(4), 613\u2013624 (1996)","journal-title":"Notre Dame J. Formal Logic"},{"key":"847_CR3","doi-asserted-by":"publisher","first-page":"579","DOI":"10.2307\/2271984","volume":"38","author":"M Blum","year":"1973","unstructured":"Blum, M., Marques, I.: On complexity properties of recursively enumerable sets. J. Symb. Logic 38, 579\u2013593 (1973)","journal-title":"J. Symb. Logic"},{"issue":"6","key":"847_CR4","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1002\/malq.201600045","volume":"62","author":"I Chitaia","year":"2016","unstructured":"Chitaia, I.: Hyperhypersimple sets and $$\\rm Q_1$$-reducibility. MLQ Math. Log. Q. 62(6), 590\u2013595 (2016)","journal-title":"MLQ Math. Log. Q."},{"key":"847_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-021-00774-7","author":"I Chitaia","year":"2021","unstructured":"Chitaia, I., Omanadze, R.: Degree structures of conjunctive reducibility. Arch. Math. Logic (2021). https:\/\/doi.org\/10.1007\/s00153-021-00774-7","journal-title":"Arch. Math. Logic"},{"key":"847_CR6","unstructured":"Degtev, A.N.: Recursively enumerable sets and reducibility of truth-table type. Nauka, Fizmatlit., Moscow (1998). (in Russian)"},{"issue":"1\u20133","key":"847_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(98)00013-X","volume":"95","author":"R Downey","year":"1998","unstructured":"Downey, R., LaForte, G., Nies, A.: Computably enumerable sets and quasi-reducibility. Ann. Pure Appl. Logic 95(1\u20133), 1\u201335 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"key":"847_CR8","doi-asserted-by":"publisher","first-page":"669","DOI":"10.2307\/2272852","volume":"39","author":"JT Gill III","year":"1974","unstructured":"Gill, J.T., III., Morris, P.H.: On subcreative sets and $$S$$-reducibility. J. Symb. Logic 39, 669\u2013677 (1974)","journal-title":"J. Symb. Logic"},{"key":"847_CR9","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, C.G., Jr.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420\u2013436 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"#cr-split#-847_CR10.1","unstructured":"Marchenkov, S. S.: A certain class of incomplete sets. Mat. Zametki, 20(4), 473-478 (1976) (in Russian)"},{"key":"#cr-split#-847_CR10.2","doi-asserted-by":"crossref","unstructured":"Math. Notes, 20, 823-825 (1976) (English translation)","DOI":"10.1007\/BF01098896"},{"issue":"2","key":"847_CR11","first-page":"124","volume":"28","author":"AS Morozov","year":"1987","unstructured":"Morozov, A.S.: On a class of recursively enumerable sets. Sibirsk. Mat. Zh. 28(2), 124\u2013128 (1987)","journal-title":"Sibirsk. Mat. Zh."},{"key":"847_CR12","unstructured":"Odifreddi, P.: Classical recursion theory. The theory of functions and sets of natural numbers. Studies in Logic and the Foundations of Mathematics, 125. North-Holland Publishing Co., Amsterdam (1989)"},{"key":"847_CR13","unstructured":"Omanadze, R. Sh.: The completeness of recursively enumerable sets. Sakharth. SSR Mecn. Akad. Moambe, 81(3), 529\u2013532 (1976) (in Russian)"},{"key":"847_CR14","doi-asserted-by":"crossref","unstructured":"Omanadze, R. Sh.: The upper semilattice of recursively enumerable $${\\rm Q}$$-degrees. Algebra i Logika, 23(2), 175\u2013184, 240\u2013241 (1984) (in Russian)","DOI":"10.1007\/BF01979705"},{"key":"#cr-split#-847_CR15.1","doi-asserted-by":"crossref","unstructured":"Omanadze, R. Sh.: On the upper semilattice of recursively enumerable $${\\rm sQ}$$-degrees. Algebra i Logika, 30(4) (1991), 405-413 (in Russian)","DOI":"10.1007\/BF01985061"},{"key":"#cr-split#-847_CR15.2","doi-asserted-by":"crossref","unstructured":"Algebra and Logic, 30(4), 265-271 (1992) (English translation)","DOI":"10.1007\/BF01985061"},{"key":"#cr-split#-847_CR16.1","doi-asserted-by":"crossref","unstructured":"Omanadze, R. Sh.: On sQ-completeness of recursively enumerable sets. Mat. Zametki, 52(3), 102-107 (1992) (in Russian)","DOI":"10.1007\/BF01209615"},{"key":"#cr-split#-847_CR16.2","doi-asserted-by":"crossref","unstructured":"Math. Notes, 52(3-4), 948-952 (1993) (English translation)","DOI":"10.1007\/BF01209615"},{"key":"#cr-split#-847_CR17.1","doi-asserted-by":"crossref","unstructured":"Omanadze, R. Sh.: Complexity properties of recursively enumerable sets, and $${\\rm sQ}$$-completeness. Mat. Zametki, 62(3), 425-429 (1997) (in Russian)","DOI":"10.4213\/mzm1624"},{"key":"#cr-split#-847_CR17.2","doi-asserted-by":"crossref","unstructured":"Math. Notes, 62(3-4), 356-359 (1998) (English translation)","DOI":"10.1007\/BF02360877"},{"issue":"7\u20138","key":"847_CR18","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/s00153-015-0451-x","volume":"54","author":"RS Omanadze","year":"2015","unstructured":"Omanadze, R.S.: Some properties of $$r$$-maximal sets and $$Q_{1, N}$$-reducibility. Arch. Math. Logic 54(7\u20138), 941\u2013959 (2015)","journal-title":"Arch. Math. Logic"},{"issue":"1","key":"847_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1093\/jigpal\/jzx058","volume":"26","author":"RS Omanadze","year":"2018","unstructured":"Omanadze, R.S.: Some structural properties of quasi-degrees. Log. J. IGPL 26(1), 191\u2013201 (2018)","journal-title":"Log. J. IGPL"},{"issue":"5\u20136","key":"847_CR20","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s00153-012-0278-7","volume":"51","author":"RS Omanadze","year":"2012","unstructured":"Omanadze, R.S., Chitaia, I.O.: $$Q_1$$-degrees of c.e. sets. Arch. Math. Logic 51(5\u20136), 503\u2013515 (2012)","journal-title":"Arch. Math. Logic"},{"issue":"7","key":"847_CR21","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s00153-006-0012-4","volume":"45","author":"RS Omanadze","year":"2006","unstructured":"Omanadze, R.S., Sorbi, A.: Strong enumeration reducibilities. Arch. Math. Logic 45(7), 869\u2013912 (2006)","journal-title":"Arch. Math. Logic"},{"key":"847_CR22","unstructured":"Rogers, H., Jr.: Theory of recursive functions and effective computability. McGraw-Hill Book Co., New York\u2013Toronto, Ont.\u2013London (1967)"},{"key":"847_CR23","unstructured":"Shavrukov V. Yu.: Sets $$Q_{1,N}$$-reducible to $$r$$-maximal sets and sets $$Q_1$$-reducible to hhsimple sets. A letter from Shavrukov V. Yu., to James Schmerl, Thomas McLaughlin, Roland Omanadze and Andrea Sorbi, January 7 (2015)"},{"key":"847_CR24","volume-title":"Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer, Berlin (1987)"},{"key":"847_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1090\/S0002-9947-1969-0241295-4","volume":"135","author":"CE Yates","year":"1969","unstructured":"Yates, C.E.: On the degrees of index sets. II. Trans. Am. Math. Soc 135, 249\u2013266 (1969)","journal-title":"Trans. Am. Math. Soc"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-022-00847-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-022-00847-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-022-00847-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T03:47:11Z","timestamp":1681703231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-022-00847-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,16]]},"references-count":29,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s00153-022-00847-1","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2022,9,16]]},"assertion":[{"value":"25 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}