Affiliation:
1. Karshi State University
2. Kazan Federal University, Volga Region Mathematical Center
Abstract
We prove that for each u ⩾ 2 the class of all single-valued Σ0 ucomputable numberings of any infinite family of total functions is effectively infinite and the class of all its Σ0 u-1-computable numberings is generated by the downward closure with respect to the reducibility of the set of all infinite direct sums of uniformly Σ0 u-1-computable sequences of its single-valued numberings. It is established that if u > 2, then the class of all Σ0 u-computable numberings of any infinite family is generated by infinite direct sums of uniformly Σ0 u-computable and uniformly Σ0 u-minimal sequences of its numberings.
Reference21 articles.
1. Yu.L. Ershov, Theory of numberings, Nauka, M., 1977 [in Russian.].
2. Yu.L. Ershov, Theory of numberings, in: E.R. Griffor (ed.), Handbook of computability theory (Stud. Logic Found. Math., 140), Amsterdam, Elsevier, 1999, 473–503. DOI: https://doi.org/10.1016/S0049-237X(99)80030-5
3. Yu.L. Ershov, Definability and computability (Siberian School of Algebra and Logic), Novosibirsk, Nauch. Kniga, M., Ekonomika, 2nd ed., 2000 [in Russian.].
4. S.S. Goncharov, A. Sorbi, Generalized computable numerations and nontrivial Rogers semilattices, Algebra Logic 36 (6), 359–369 (1997). DOI: https://doi.org/10.1007/BF02671553
5. S.A. Badaev, S.S. Goncharov, Rogers semilattices of families of arithmetic sets, Algebra Logic 40 (5), 283–291 (2001). DOI: https://doi.org/10.1023/A:1012516217265