Positive Reducibilities, Extreme Numberings, and Completeness
-
Published:2023-08
Issue:3
Volume:33
Page:204-213
-
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
Reference22 articles.
1. S. A. Badaev, “On minimal numerations,” Trudy Inst. Mat. 25, 3 (1993) [Siberian Adv. Math. 2:2, 1 (1992)].
2. 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)].
3. S. A. Badaev and S. S. Goncharov, “Generalized computable universal
numberings,” Algebra i logika 53, 555 (2014) [Algebra and
Logic 53, 355 (2014)].
4. S. A. Badaev, S. S. Goncharov, and A. Sorbi, “Completeness and universality
of arithmetical numberings,” in: Computability and
Models, 11 (Springer, Boston, MA, 2003).
5. S. A. Badaev, S. S. Goncharov, and A. Sorbi, “Some remarks on completions
of numberings,” Sib. Matem. Zh. 49, 986 (2008) [Siberian
Math. J. 49, 780 (2008)].