Voir la notice de l'article provenant de la source Math-Net.Ru
@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}, publisher = {mathdoc}, number = {6}, year = {2009}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/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