Abstract
We show that the sQ-degree of a hypersimple set includes an infinite collection of \(sQ_1\)-degrees linearly ordered under \(\le _{sQ_1}\) with order type of the integers and each c.e. set in these sQ-degrees is a hypersimple set. Also, we prove that there exist two c.e. sets having no least upper bound on the \(sQ_1\)-reducibility ordering. We show that the c.e. \(sQ_1\)-degrees are not dense and if a is a c.e. \(sQ_1\)-degree such that \(o_{sQ_1}<_{sQ_1}a<_{sQ_1}o'_{sQ_1}\), then there exist infinitely many pairwise sQ-incomputable c.e. sQ-degrees \(\{c_i\}_{i\in \omega }\) such that \((\forall \,i)\;(a<_{sQ_1}c_i<_{sQ_1}o'_{sQ_1})\).
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Belegradek, O.V.: Algebraically closed groups. Algebra i Logika 13, 239–255 (1974). (in Russian)
Belegradek, O.V.: Higman’s embedding theorem in a general setting and its application to existentially closed algebras. Notre Dame J. Formal Logic 37(4), 613–624 (1996)
Blum, M., Marques, I.: On complexity properties of recursively enumerable sets. J. Symb. Logic 38, 579–593 (1973)
Chitaia, I.: Hyperhypersimple sets and \(\rm Q_1\)-reducibility. MLQ Math. Log. Q. 62(6), 590–595 (2016)
Chitaia, I., Omanadze, R.: Degree structures of conjunctive reducibility. Arch. Math. Logic (2021). https://doi.org/10.1007/s00153-021-00774-7
Degtev, A.N.: Recursively enumerable sets and reducibility of truth-table type. Nauka, Fizmatlit., Moscow (1998). (in Russian)
Downey, R., LaForte, G., Nies, A.: Computably enumerable sets and quasi-reducibility. Ann. Pure Appl. Logic 95(1–3), 1–35 (1998)
Gill, J.T., III., Morris, P.H.: On subcreative sets and \(S\)-reducibility. J. Symb. Logic 39, 669–677 (1974)
Jockusch, C.G., Jr.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420–436 (1968)
Marchenkov, S. S.: A certain class of incomplete sets. Mat. Zametki, 20(4), 473–478 (1976) (in Russian); Math. Notes, 20, 823–825 (1976) (English translation)
Morozov, A.S.: On a class of recursively enumerable sets. Sibirsk. Mat. Zh. 28(2), 124–128 (1987)
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)
Omanadze, R. Sh.: The completeness of recursively enumerable sets. Sakharth. SSR Mecn. Akad. Moambe, 81(3), 529–532 (1976) (in Russian)
Omanadze, R. Sh.: The upper semilattice of recursively enumerable \({\rm Q}\)-degrees. Algebra i Logika, 23(2), 175–184, 240–241 (1984) (in Russian)
Omanadze, R. Sh.: On the upper semilattice of recursively enumerable \({\rm sQ}\)-degrees. Algebra i Logika, 30(4) (1991), 405–413 (in Russian); Algebra and Logic, 30(4), 265–271 (1992) (English translation)
Omanadze, R. Sh.: On sQ-completeness of recursively enumerable sets. Mat. Zametki, 52(3), 102–107 (1992) (in Russian); Math. Notes, 52(3-4), 948–952 (1993) (English translation)
Omanadze, R. Sh.: Complexity properties of recursively enumerable sets, and \({\rm sQ}\)-completeness. Mat. Zametki, 62(3), 425–429 (1997) (in Russian); Math. Notes, 62(3-4), 356–359 (1998) (English translation)
Omanadze, R.S.: Some properties of \(r\)-maximal sets and \(Q_{1, N}\)-reducibility. Arch. Math. Logic 54(7–8), 941–959 (2015)
Omanadze, R.S.: Some structural properties of quasi-degrees. Log. J. IGPL 26(1), 191–201 (2018)
Omanadze, R.S., Chitaia, I.O.: \(Q_1\)-degrees of c.e. sets. Arch. Math. Logic 51(5–6), 503–515 (2012)
Omanadze, R.S., Sorbi, A.: Strong enumeration reducibilities. Arch. Math. Logic 45(7), 869–912 (2006)
Rogers, H., Jr.: Theory of recursive functions and effective computability. McGraw-Hill Book Co., New York–Toronto, Ont.–London (1967)
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)
Soare, R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer, Berlin (1987)
Yates, C.E.: On the degrees of index sets. II. Trans. Am. Math. Soc 135, 249–266 (1969)
Acknowledgements
The author is very grateful to the anonymous referee for careful reading and the comments which have improved the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Omanadze, R.S. \(sQ_1\)-degrees of computably enumerable sets. Arch. Math. Logic 62, 401–417 (2023). https://doi.org/10.1007/s00153-022-00847-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-022-00847-1