Abstract
We prove the existence of a family of computably enumerable sets that, up to equivalence, has a unique computable minimal but not least numbering.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Badaev S.A. and Goncharov S.S., “On computable minimal enumerations,” in: Algebra. Proc. 3rd Int. Conf. Algebra. (in memory of M.I. Kargopolov), De Gruyter, Berlin and New York (1995), 21–33.
Badaev S.A. and Goncharov S.S., “Theory of numberings,” in: Open Problems in Computability Theory and Its Applications, Amer. Math. Soc., Providence (2000), 23–38 (Contemp. Math.; vol. 257).
Marchenkov S.S., “The computable enumerations of families of general recursive functions,” Algebra Logic, vol. 11, no. 5, 326–336 (1972).
Goncharov S.S., “Computable single-valued numerations,” Algebra Logic, vol. 19, no. 5, 325–356 (1980).
Goncharov S.S., “Positive computable numberings,” Russ. Acad. Sci. Dokl., vol. 48, no. 2, 268–270 (1994).
Goncharov S.S., “A family with a unique univalent but not least numeration,” Trudy Inst. Mat. Sib. Otd. AN SSSR, vol. 8, 42–58 (1988).
Goncharov S.S., “Families with a unique positive numbering,” Vychisl. Sistemy, no. 146, 96–104 (1992).
Goncharov S.S., Harizanov V., Knight J., McCoy C., Miller R., and Solomon R., “Enumerations in computable structure theory,” Ann. Pure Appl. Logic, vol. 136, no. 3, 219–246 (2005).
Hirschfeldt D.R., “Degree spectra of relations on computable structures,” Bull. Symb. Logic, vol. 6, no. 2, 197–212 (2000).
Ershov Yu.L., Theory of Numberings, Nauka, Moscow (1977) [Russian].
Ershov Yu.L., “Enumeration of families of general recursive functions,” Sib. Math. J., vol. 8, no. 5, 771–778 (1967).
Semukhin P., “Prime models of finite computable dimension,” J. Symb. Logic, vol. 74, no. 1, 336–348 (2009).
Badaev S.A., “Minimal enumerations,” in: Mathematical Logic and Algorithm Theory. Tr. Inst. Mat., vol. 25 (1993), 3–34 [Russian].
Badaev S.A., “Minimal numerations of positively computable families,” Algebra Logic, vol. 33, no. 3, 131–141 (1994).
V’yugin V.V., “On some examples of upper semilattices of computable enumerations,” Algebra Logic, vol. 12, no. 5, 512–529 (1973).
Goncharov S.S., Yakhnis A., and Yakhnis V., “Some effectively infinite classes of enumerations,” Ann. Pure Appl. Logic, vol. 60, no. 3, 207–235 (1993).
Goncharov S.S. and Sorbi A., “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra Logic, vol. 36, no. 6, 359–369 (1997).
Badaev S.A. and Goncharov S.S., “Rogers semilattices of families of arithmetic sets,” Algebra Logic, vol. 40, no. 5, 283–291 (2001).
Badaev S.A. and Lempp S., “A decomposition of the Rogers semilattice of a family of d.c.e. sets,” J. Symb. Log., vol. 74, no. 2, 618–640 (2009).
Faizrahmanov M.Kh., “Minimal generalized computable enumerations and high degrees,” Sib. Math. J., vol. 58, no. 3, 553–558 (2017).
Faizrahmanov M.Kh., “Extremal numberings and fixed point theorems,” Math. Logic Quart., vol. 68, no. 4, 398–408 (2022).
Faizrahmanov M.Kh., “Two theorems on minimal generalized computable numberings,” Moscow Univ. Math. Bull., vol. 78, no. 3, 136–143 (2023).
Faizrahmanov M.Kh., “On \( p \)-universal and \( p \)-minimal numberings,” Sib. Math. J., vol. 63, no. 2, 365–373 (2022).
Faizrahmanov M.Kh., “Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets,” Sib. Math. J., vol. 64, no. 1, 174–180 (2023).
Ershov Yu.L., “Theory of numberings,” in: Handbook of Computability Theory, Elsevier, Amsterdam (1999), 473–503 (Stud. Logic Found. Math.; vol. 140).
Soare R.I., Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Springer, Berlin, Heidelberg, New York, London, Paris, and Tokyo (1987).
Soare R.I., Turing Computability: Theory and Applications, Springer, Berlin (2016) (Theory and Applications of Computability).
Acknowledgments
The author is indebted to the referee for the deep understanding of the article and invaluable remarks, recommendations, and suggestions.
Funding
The author was supported by the Russian Science Foundation (Grant no. 23–21–00181). His work was supported by the Mathematical Center of the Volga Region Federal District (Agreement 075–02–2023–944).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
As author of this work, I declare that I have no conflicts of interest.
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, 2024, Vol. 65, No. 2, pp. 394–406. https://doi.org/10.33048/smzh.2024.65.212
Publisher's Note
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Faizrahmanov, M.K. A Family with a Single Minimal but Not Least Numbering. Sib Math J 65, 381–391 (2024). https://doi.org/10.1134/S0037446624020125
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446624020125