Geodesic
SET-1 reducibility in the class of computable sets
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (2006), pp. 69-75 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_2006_8_a8,
     author = {A. N. Frolov},
     title = {SET-1 reducibility in the class of computable sets},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {69--75},
     year = {2006},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2006_8_a8/}
}
TY  - JOUR
AU  - A. N. Frolov
TI  - SET-1 reducibility in the class of computable sets
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2006
SP  - 69
EP  - 75
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/IVM_2006_8_a8/
LA  - ru
ID  - IVM_2006_8_a8
ER  - 
%0 Journal Article
%A A. N. Frolov
%T SET-1 reducibility in the class of computable sets
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2006
%P 69-75
%N 8
%U http://geodesic.mathdoc.fr/item/IVM_2006_8_a8/
%G ru
%F IVM_2006_8_a8
A. N. Frolov. SET-1 reducibility in the class of computable sets. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (2006), pp. 69-75. http://geodesic.mathdoc.fr/item/IVM_2006_8_a8/

[1] Soar R. I., Vychislimo perechislimye mnozhestva i stepeni, Kazanskoe matem. ob-vo, Kazan, 2000, 576 pp. | MR | Zbl

[2] Cook S. A., “The complexity of theorem proving procedures”, Proc. 3-rd Ann. ACM Symp. on Thery of Comp., 1971, 151–158 | Zbl

[3] Frolov A. N., “Teoretiko-mnozhestvennye svodimosti po reshetke mnozhestv”, Izv. vuzov. Matematika, 2006, no. 1, 57–67 | MR | Zbl

[4] Frolov A. N., “Teoretiko-mnozhestvennaya struktura vychislimykh mnozhestv”, Izv. vuzov. Matematika, 2003, no. 10, 70–76 | MR | Zbl