On Numberings for Classes of Families of Total Functions
-
Published:2022-11
Issue:4
Volume:32
Page:237-249
-
ISSN:1055-1344
-
Container-title:Siberian Advances in Mathematics
-
language:en
-
Short-container-title:Sib. Adv. Math.
Author:
Faĭzrahmanov M. Kh.
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference17 articles.
1. S. A. Badaev and S. S. Goncharov, “Rogers semilattices of families of
arithmetic sets,” Algebra i logika 40, 507 (2001) [Algebra
and Logic 40, 283 (2001)].
2. S. A. Badaev and S. S. Goncharov, “Generalized computable universal
numberings,” Algebra i logika 53, 555 (2014) [Algebra and
Logic 53, 355 (2014)].
3. S. Badaev, S. Goncharov, and A. Sorbi, “Completeness and universality of
arithmetical numberings,” in: Computability and Models,
11 (Springer, Boston, MA, 2003).
4. S. B. Cooper, “Partial degrees and the density problem. II: The enumeration
degrees of the $$
\Sigma ^0_2$$ sets are dense,” J. Symbolic Logic
49, 503 (1984).
5. Yu. L. Ershov, “Enumeration of families of general recursive functions,” Sib.
Mathem. Zh. 8, 1015 (1967) [Siberian Math. J. 8, 771 (1968)].