Geodesic
Properties of weak pm-reducibility of sets
Modelirovanie i analiz informacionnyh sistem, Tome 17 (2010) no. 1, pp. 44-51 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A new reducibility (the so-called apm-reducibility) of enumeration type, which is weaker than the pm-reducibility is introduced in this paper. Some important properties of this new reducibility are proved here.
Keywords: computability, enumeration reducibility, enumeration degrees, almost partial m-reducibility. 
@article{MAIS_2010_17_1_a2,
     author = {K. V. Petrova},
     title = {Properties of weak pm-reducibility of sets},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {44--51},
     year = {2010},
     volume = {17},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a2/}
}
TY  - JOUR
AU  - K. V. Petrova
TI  - Properties of weak pm-reducibility of sets
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2010
SP  - 44
EP  - 51
VL  - 17
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a2/
LA  - ru
ID  - MAIS_2010_17_1_a2
ER  - 
%0 Journal Article
%A K. V. Petrova
%T Properties of weak pm-reducibility of sets
%J Modelirovanie i analiz informacionnyh sistem
%D 2010
%P 44-51
%V 17
%N 1
%U http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a2/
%G ru
%F MAIS_2010_17_1_a2
K. V. Petrova. Properties of weak pm-reducibility of sets. Modelirovanie i analiz informacionnyh sistem, Tome 17 (2010) no. 1, pp. 44-51. http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a2/

[1] Yu. L. Ershov, Teoriya numeratsii, Nauka, M., 1977, 416 pp. | MR

[2] E. A. Polyakov, M. G. Rozinas, Teoriya algoritmov: Uchebnoe posobie po spetskursu dlya studentov-matematikov, Ivanovo, 1976 | MR

[3] Kh. Rodzhers, Teoriya rekursivnykh funktsii i effektivnaya vychislimost, Mir, M., 1972 | MR

[4] R. I. Soar, Vychislimo perechislimye mnozhestva i stepeni., Kazanskoe matematicheskoe obschestvo, Kazan, 2000, 576 pp. | MR | Zbl