Geodesic
On the algorithmic decidability of property of expressibility for polynomials
Fundamentalʹnaâ i prikladnaâ matematika, Tome 5 (1999) no. 3, pp. 931-935.

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of the algorithmic decidabilty of property of expressibility for functional systems of polynomials with natural, integer and rational coefficients is solved. 
@article{FPM_1999_5_3_a20,
     author = {V. Sh. Darsalia},
     title = {On the algorithmic decidability of property of expressibility for polynomials},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {931--935},
     publisher = {mathdoc},
     volume = {5},
     number = {3},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_1999_5_3_a20/}
}
TY  - JOUR
AU  - V. Sh. Darsalia
TI  - On the algorithmic decidability of property of expressibility for polynomials
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 1999
SP  - 931
EP  - 935
VL  - 5
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_1999_5_3_a20/
LA  - ru
ID  - FPM_1999_5_3_a20
ER  - 
%0 Journal Article
%A V. Sh. Darsalia
%T On the algorithmic decidability of property of expressibility for polynomials
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 1999
%P 931-935
%V 5
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_1999_5_3_a20/
%G ru
%F FPM_1999_5_3_a20
V. Sh. Darsalia. On the algorithmic decidability of property of expressibility for polynomials. Fundamentalʹnaâ i prikladnaâ matematika, Tome 5 (1999) no. 3, pp. 931-935. http://geodesic.mathdoc.fr/item/FPM_1999_5_3_a20/