Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2006_3_a0, author = {M. M. Arslanov and N. Kehayopulu}, title = {Weak presentations of computable partially ordered semigroups}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {3--8}, publisher = {mathdoc}, number = {3}, year = {2006}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2006_3_a0/} }
M. M. Arslanov; N. Kehayopulu. Weak presentations of computable partially ordered semigroups. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 3 (2006), pp. 3-8. http://geodesic.mathdoc.fr/item/IVM_2006_3_a0/
[1] Jockusch C. G. Jr., Shlapentokh A., “Weak presentations of computable fields”, J. Symb. Logic, 60 (1995), 199–208 | DOI | MR | Zbl
[2] Soare R. I., Computably Enumerable Sets and Degrees, Springer-Verlag, Berlin, 1987, 576 pp. | MR
[3] Kehayopulu N., Tsingelis M., “The embedding of some ordered semigroups into ordered groups”, Semigroup Forum, 60 (2000), 344–350 | DOI | MR | Zbl