Abstract
In this work, we study computable families of Turing degrees introduced and first studied by Arslanov and their numberings. We show that there exist finite families of Turing c.e. degrees both those with and without computable principal numberings and that every computable principal numbering of a family of Turing degrees is complete with respect to any element of the family. We also show that every computable family of Turing degrees has a complete with respect to each of its elements computable numbering even if it has no principal numberings. It follows from results by Mal’tsev and Ershov that complete numberings have nice programming tools and computational properties such as Kleene’s recursion theorems, Rice’s theorem, Visser’s ADN theorem, etc. Thus, every computable family of Turing degrees has a computable numbering with these properties. Finally, we prove that the Rogers semilattice of each such non-empty non-singleton family is infinite and is not a lattice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Mal’tsev, A.I.: Sets with complete numberings (Russian). Algebra Log. 2(2), 4–29 (1963)
Mal’tsev, A.I.: The Metamathematics of Algebraic Systems. North-Holland Publishing Co., Amsterdam (1971)
Visser, A.: Numberings, \(\lambda \)-calculus and arithmetic. In: Essays on Combinatory Logic. Lambda Calculus and Formalism, pp. 259–284. Academic Press, New York (1980)
Ershov, Y.L.: Completely enumerated sets. Sib. Math. J. 10(5), 773–784 (1969)
Ershov, Y.L.: Theory of Numberings (Russian). Nauka, Moscow (1977)
Arslanov, M.M.: Fixed-point selection functions. Lobachevskii J. Math. 42(4), 685–692 (2021)
Badaev, S.A., Goncharov, S.S., Sorbi, A.: Completeness and universality of arithmetical numberings. In: Computability and Models, pp. 11–44. Springer, Boston, MA (2003)
Badaev, S.A., Goncharov, S.S., Sorbi, A.: Some remarks on completion of numberings. Sib. Math. J. 49(5), 780–783 (2008)
Faizrahmanov, M.: Extremal numberings and fixed point theorems. Math. Log. Quart. 68(4), 398–408 (2022)
Faizrahmanov, M.: Numberings, c.e. oracles, and fixed points. Computability, 12(3), 217–282 (2023)
Jain, S., Nessel, J.: Some independence results for control structures in complete numberings. J. Symb. Log. 66(1), 357–382 (2001)
Muchnik, A.A.: Isomorphism of systems of recursively enumerable sets with effective properties (Russian). Tr. Mosk. Mat. Obs. 7, 407–412 (1958)
Myhill, J.: Creative sets. Zeitschr. J. Math. Logik und Grundlagen d. Math 1(2), 97–108 (1955)
Rogers, H.: Gödel numberings of partial recursive functions. J. Symb. Log. 23(3), 331–341 (1958)
Smullyan, H.M.: Theory of Formal Systems. Princeton University Press, Princeton (1960)
Arslanov, M.M.: Families of recursively enumerable sets and their degrees of unsolvability. Sov. Math. 29(4), 13–21 (1985)
Uspensky, V.A., Semenov, A.L.: Algorithms: Main Ideas and Applications. Kluwer Academic Publishers, Dordrecht (1993)
Goncharov, S.S.: Computable single-valued numerations. Algebra Log. 19(5), 325–356 (1980)
Goncharov, S.S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Log. 136(3), 219–246 (2005)
Ambos-Spies, K., Badaev, S.A., Goncharov, S.S.: Inductive inference and computable numberings. Theor. Comput. Sci. 412(18), 1652–1668 (2011)
Andrews, U., Badaev, S.A., Sorbi, A.: A survey on universal computably enumerable equivalence relations. In: Computability and Complexity, pp. 418–451. Springer, Cham (2017)
Barendregt, H., Terwijn, S.A.: Partial combinatory algebra and generalized numberings. Theor. Comput. Sci. 925, 37–44 (2022)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)
Ershov, Y.L.: Theory of numberings. In: Handbook of Computability Theory, pp. 473–503. Elsevier, North-Holland, Amsterdam (1999)
Ershov, Y.L.: On inseparable pairs. Algebra Log. 9(6), 396–399 (1970)
Yates, C.E.M.: On the degrees of index sets. Trans. Am. Math. Soc. 121(2), 309–328 (1966)
Khutoretskii, A.B.: On the cardinality of the upper semilattice of computable enumerations. Algebra Log. 10(5), 348–352 (1971)
Selivanov, V.L.: Two theorems on computable numberings. Algebra Log. 15(4), 297–306 (1976)
Goncharov, S.S., Sorbi, A.: Generalized computable numerations and nontrivial Rogers semilattices. Algebra Log. 36(6), 359–369 (1997)
Acknowledgements
This work was supported by the Russian Science Foundation (Grant No. 23-21-00181) and performed under the development programme of the Volga Region Mathematical Center (Agreement No. 075-02-2024-1438).
Author information
Authors and Affiliations
Contributions
M.F. worked on the manuscript and received all its results single-handedly.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing interests.
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 (e.g. a society or other partner) 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
Faizrahmanov, M. On computable numberings of families of Turing degrees. Arch. Math. Logic (2024). https://doi.org/10.1007/s00153-024-00914-9
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00153-024-00914-9