Geodesic
Complexity properties of recursively enumerable sets and $bsQ$-completeness
Matematičeskie zametki, Tome 68 (2000) no. 4, pp. 554-559.

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

@article{MZM_2000_68_4_a6,
     author = {R. Sh. Omanadze},
     title = {Complexity properties of recursively enumerable sets and $bsQ$-completeness},
     journal = {Matemati\v{c}eskie zametki},
     pages = {554--559},
     publisher = {mathdoc},
     volume = {68},
     number = {4},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/}
}
TY  - JOUR
AU  - R. Sh. Omanadze
TI  - Complexity properties of recursively enumerable sets and $bsQ$-completeness
JO  - Matematičeskie zametki
PY  - 2000
SP  - 554
EP  - 559
VL  - 68
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/
LA  - ru
ID  - MZM_2000_68_4_a6
ER  - 
%0 Journal Article
%A R. Sh. Omanadze
%T Complexity properties of recursively enumerable sets and $bsQ$-completeness
%J Matematičeskie zametki
%D 2000
%P 554-559
%V 68
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/
%G ru
%F MZM_2000_68_4_a6
R. Sh. Omanadze. Complexity properties of recursively enumerable sets and $bsQ$-completeness. Matematičeskie zametki, Tome 68 (2000) no. 4, pp. 554-559. http://geodesic.mathdoc.fr/item/MZM_2000_68_4_a6/

[1] Blum M., Marques I., “Complexity properties of recursively enumerable sets”, J. Symbolic Logic, 38:4 (1973), 579–593 | DOI | MR

[2] Gill J. T., Morris P. H., “On subcreative sets and $S$-reducibility”, J. Symbolic Logic, 39:4 (1974), 669–677 | DOI | MR

[3] Omanadze R. Sh., “Slozhnostnye svoistva rekursivno perechislimykh mnozhestv i $sQ$-polnota”, Matem. zametki, 63:3 (1997), 425–429 | MR

[4] Rodzhers Kh., Teoriya rekursivnykh funktsii i effektivnaya vychislimost, Mir, M., 1972

[5] Blum M., “A machine-independent theory of the complexity of recursive functions”, J. Assoc. Comput. Math., 14 (1967), 322–336 | MR | Zbl

[6] Omanadze R. Sh., “Ob odnom usilenii $Q$-svodimosti”, Algebra i logika, 34:1 (1995), 79–87 | MR | Zbl

[7] Friedberg R. M., Rogers H., “Reducibility and completeness for sets of integers”, Z. Math. Logik Grundlag. Math., 5 (1959), 117–125 | DOI | MR | Zbl

[8] Bulitko V. K., “O sposobakh kharakterizatsii polnykh mnozhestv”, Izv. AN SSSR. Ser. matem., 55:2 (1991), 227–253 | MR | Zbl

[9] Omanadze R. Sh., “Ob ogranichennoi $Q$-svodimosti”, Soobsch. AN GSSR, 100:1 (1980), 57–60 | MR | Zbl

[10] Degtev A. N., Rekursivno perechislimye mnozhestva i svodimosti tablichnogo tipa, M., Nauka; M., Fizmatlit, 1998 | Zbl

[11] Ershov Yu. L., “Pozitivnye ekvivalentnosti”, Algebra i logika, 10:6 (1971), 620–650 | MR | Zbl

[12] Denisov S. D., “Tri teoremy ob elementarnykh teoriyakh i $tt$-svodimosti”, Algebra i logika, 13:4 (1974), 5–8 | Zbl

[13] Degtev A. N., “O $tt$- i $m$-stepenyakh”, Algebra i logika, 12:2 (1973), 143–161 | MR | Zbl