RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive
Fundam. Prikl. Mat., 1999 Volume 5, Issue 3, Pages 931–935 (Mi fpm403)
This article is cited in 2 papers

Short communications

On the algorithmic decidability of property of expressibility for polynomials

V. Sh. Darsalia

M. V. Lomonosov Moscow State University

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

UDC: 915.95

Received: 01.04.1996



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025