FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

1999, VOLUME 5, NUMBER 3, PAGES 931-935

On the algorithmic decidability of property of expressibility for polynomials

V. Sh. Darsalia

Abstract

View as HTML     View as gif image    View as LaTeX source

The problem of the algorithmic decidabilty of property of expressibility for functional systems of polynomials with natural, integer and rational coefficients is solved.

All articles are published in Russian.

Location: http://mech.math.msu.su/~fpm/eng/99/993/99321h.htm
Last modified: November 11, 1999