Geodesic
Relations between algorithmic reducibilities of algebraic systems
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2009), pp. 71-72 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this paper we adduce examples of various algorithmic reducibilities of algebraic systems.
Keywords: algebraic system, Turing operator, enumeration operator, $\Sigma$-definability. 
@article{IVM_2009_6_a9,
     author = {I. Sh. Kalimullin},
     title = {Relations between algorithmic reducibilities of algebraic systems},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {71--72},
     year = {2009},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2009_6_a9/}
}
TY  - JOUR
AU  - I. Sh. Kalimullin
TI  - Relations between algorithmic reducibilities of algebraic systems
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2009
SP  - 71
EP  - 72
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/IVM_2009_6_a9/
LA  - ru
ID  - IVM_2009_6_a9
ER  - 
%0 Journal Article
%A I. Sh. Kalimullin
%T Relations between algorithmic reducibilities of algebraic systems
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2009
%P 71-72
%N 6
%U http://geodesic.mathdoc.fr/item/IVM_2009_6_a9/
%G ru
%F IVM_2009_6_a9
I. Sh. Kalimullin. Relations between algorithmic reducibilities of algebraic systems. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2009), pp. 71-72. http://geodesic.mathdoc.fr/item/IVM_2009_6_a9/

[1] Stukachev A. I., “O stepenyakh predstavimosti modelei. I”, Algebra i logika, 46:6 (2007), 763–788 | MR | Zbl

[2] Goncharov S. S., Harizanov V. S., Knight J. F., McCoy C., Miller R. G., Solomon R., “Enumerations in computable structure theory”, J. Annals Pure Appl. Logic, 136:3 (2005), 219–246 | DOI | MR | Zbl