Geodesic
Completeness criterions for a class of reducubilities
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 10 (2022), pp. 73-78.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper we consider the completeness criterions for a class of sub-Turing reducibilities.
Keywords: Turing reducibility, m-reducibility, tt-reducibility, Q-reducibility, fixed points of the function, completeness criterion. 
@article{IVM_2022_10_a6,
     author = {M. M. Arslanov},
     title = {Completeness criterions for a class of reducubilities},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {73--78},
     publisher = {mathdoc},
     number = {10},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2022_10_a6/}
}
TY  - JOUR
AU  - M. M. Arslanov
TI  - Completeness criterions for a class of reducubilities
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2022
SP  - 73
EP  - 78
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2022_10_a6/
LA  - ru
ID  - IVM_2022_10_a6
ER  - 
%0 Journal Article
%A M. M. Arslanov
%T Completeness criterions for a class of reducubilities
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2022
%P 73-78
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2022_10_a6/
%G ru
%F IVM_2022_10_a6
M. M. Arslanov. Completeness criterions for a class of reducubilities. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 10 (2022), pp. 73-78. http://geodesic.mathdoc.fr/item/IVM_2022_10_a6/

[1] Soare R. I., Recursively enumerable sets and degrees. A study of computable functions and computably generated sets, Perspectives in math. logic, Springer-Verlag, Berlin–Heidelberg–N.Y., etc., 1987 | DOI | MR

[2] Arslanov M. M., “Truth table complete computably enumerable sets”, Computability and Models, eds. S.B. Cooper, S.S. Goncharov, Kluwer Academic/Plenum Publishers, New York–Boston–Dordrecht–London–M., 2002, 1–10 | MR

[3] Arslanov M. M., “Polnota v arifmeticheskoi ierarkhii i nepodvizhnye tochki”, Algebra i logika, 28:1 (1989), 3–17 | MR

[4] Arslanov M. M., “O nekotorykh obobscheniyakh teoremy o nepodvizhnoi tochke”, Izv. vuzov. Matem., 1981, no. 5, 9–16 | Zbl

[5] Solovev V. D., “Nekotorye obobscheniya ponyatii svodimosti i kreativnosti”, Izv. vuzov. Matem., 1976, no. 3, 65–72 | Zbl

[6] Batyrshin I. I., “Quasi-completeness and functions without fixed-points”, Math. Log. Quart., 52:6 (2006), 595–601 | DOI | MR | Zbl

[7] Bulitko V. K., “O sposobakh kharakterizatsii polnykh mnozhestv”, Izvestiya AN SSSR, Seriya Matematicheskaya, 55:2 (1991), 227–253 | Zbl

[8] Degtev A. N., Rekursivno perechislimye mnozhestva i svodimosti tablichnogo tipa, Nauka, Fizmatlit, M., 1998

[9] Bulitko V. K., “Pismo v redaktsiyu”, Izv. AN SSSR, Ser. matem., 56:4 (1992), 907 | Zbl

[10] Myhill J., “Creative sets”, Z. Math. Logik Grundl. Math., 1955, no. 1, 97–108 | DOI | MR | Zbl