We prove various sufficient conditions for the effective infinity of classes of computable numberings. Then we apply them to show that for every computable family of left-c.e. reals without the greatest element the class of its Friedberg computable numberings is effectively infinite. In particular, this result covers the families of all left-c.e. and all Martin-Löf random left-c.e. reals whose Friedberg computable numberings have been constructed by Broadhead and Kjos-Hanssen in their paper (In Mathematical Theory and Computational Practice, CiE 2009 (2009) 49–58 Springer). In addition, for every infinite computable family of left-c.e. reals we prove that the classes of all its computable, positive and minimal numberings are effectively infinite.
S.A.Badaev and S.S.Goncharov, On computable minimal enumerations, in: Algebra. Proceedings of the Third International Conference on Algebra, Dedicated to the Memory of M.I. Kargopolov, Krasnoyarsk, August 23–28, 1993, Y.L.Ershov, E.I.Khukhro, V.M.Levchuk and N.D.Podufalov, eds, Walter de Gruyter, Berlin–New York, 1995, pp. 21–32. doi:10.1515/9783110813418-005.
3.
S.A.Badaev and S.S.Goncharov, The theory of numberings: Open problems, in: Computability Theory and Its Applications. Current Trends and Open Problems, P.A.Cholak, S.Lempp, M.Lerman and R.A.Shore, eds, Amer. Math. Soc., Providence, 2000, pp. 23–38. doi:10.1090/conm/257/04025.
4.
S.A.Badaev and S.S.Goncharov, Rogers semilattices of families of arithmetic sets, Algebra and Logic40 (2001), 283–291. doi:10.1023/A:1012516217265.
5.
P.Brodhead and B.Kjos-Hanssen, Numberings and randomness, in: Mathematical Theory and Computational Practice, CiE 2009, K.Ambos-Spies, B.Löwe and W.Merkle, eds, Lecture Notes in Computer Science, Vol. 5635, Springer, Berlin, Heidelberg, 2009, pp. 49–58. doi:10.1007/978-3-642-03073-4_6.
6.
R.G.Downey and D.R.Hirschfeld, Algorithmic Randomness and Complexity, Springer-Verlag, New York, 2010.
7.
Y.L.Ershov, Theorie der numerierungen I, Z. Math. Logik und Grundlag. Math.19 (1973), 19–25. 289–388.
8.
Y.L.Ershov, Theory of Numberings, Nauka, Moscow, 1977, In Russian.
9.
Y.L.Ershov, Theory of numberings, in: Handbook of Computability Theory, E.R.Griffor, ed., Stud. Logic Found. Math., Vol. 140, Elsevier, Amsterdam, 1999, pp. 473–503. doi:10.1016/S0049-237X(99)80030-5.
10.
M.Faizrahmanov, Limitwise monotonic spectra and their generalizations, in: Connecting with Computability, CiE 2021, L.De Mol, A.Weiermann, F.Manea and D.Fernández-Duque, eds, Lecture Notes in Computer Science, Vol. 12813, Springer, Cham, 2021, pp. 189–198. doi:10.1007/978-3-030-80049-9_17.
11.
M.Faizrahmanov, A local version of the Slaman–Wehner theorem and families closed under finite differences, Notre Dame J. Form. Log.64 (2023), 197–203. doi:10.1215/00294527-10670074.
12.
M.Faizrahmanov, Effectively infinite classes of numberings of computable families of reals, Izv. Vyssh. Uchebn. Zaved. Mat.67 (2023), 96–100, (in Russian). doi:10.26907/0021-3446-2023-5-96-100.
13.
M.Faizrahmanov and I.Kalimullin, Limitwise monotonic sets of reals, Math. Log. Quart.61 (2015), 224–229. doi:10.1002/malq.201400015.
14.
R.M.Friedberg, Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication, J. Symb. Logic23 (1958), 309–316. doi:10.2307/2964290.
15.
S.S.Goncharov and A.Sorbi, Generalized computable numerations and nontrivial Rogers semilattices, Algebra and Logic36 (1997), 621–641. doi:10.1007/BF02671553.
16.
S.S.Goncharov, A.Yakhnis and V.Yakhnis, Some effectively infinite classes of enumerations, Ann. and Pure Appl. Log.60 (1993), 207–235. doi:10.1016/0168-0072(93)90076-P.
17.
K.Harris, η-representation of sets and degrees, J. Symb. Logic73 (2008), 1097–1121. doi:10.2178/jsl/1230396908.
18.
M.Kummer, An easy priority-free proof of a theorem of Friedberg, Theoret. Comput. Sci.74 (1990), 249–251. doi:10.1016/0304-3975(90)90141-4.
19.
A.I.Mal’tsev, Positive and negative enumerations, Dokl. Akad. Nauk SSSR160 (1965), 278–280.
20.
J.Myhill, Creative sets, Z. Math. Logik und Grundlag. Math.1 (1955), 97–108. doi:10.1002/malq.19550010205.
21.
A.Nies, Computability and Randomness, Oxford University Press, New York, 2009.
22.
R.I.Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Funtions and Computably Generated Sets, Perspect. Math. Log., Springer-Verlag, Berlin, 1987.
23.
R.I.Soare, Turing Computability: Theory and Applications, Springer, Berlin, 2016.
24.
V.A.Uspenskii, Some notes on recursively enumerable sets, Z. Math. Log. und Grundl. Math.3 (1957), 157–170. doi:10.1002/malq.19570031202.
