Geodesic
On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions
Diskretnaya Matematika, Tome 24 (2012) no. 4, pp. 56-69

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

@article{DM_2012_24_4_a4,
     author = {V. A. Buevich and M. A. Podkolzina},
     title = {On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions},
     journal = {Diskretnaya Matematika},
     pages = {56--69},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2012_24_4_a4/}
}
TY  - JOUR
AU  - V. A. Buevich
AU  - M. A. Podkolzina
TI  - On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions
JO  - Diskretnaya Matematika
PY  - 2012
SP  - 56
EP  - 69
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2012_24_4_a4/
LA  - ru
ID  - DM_2012_24_4_a4
ER  - 
%0 Journal Article
%A V. A. Buevich
%A M. A. Podkolzina
%T On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions
%J Diskretnaya Matematika
%D 2012
%P 56-69
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2012_24_4_a4/
%G ru
%F DM_2012_24_4_a4
V. A. Buevich; M. A. Podkolzina. On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions. Diskretnaya Matematika, Tome 24 (2012) no. 4, pp. 56-69. http://geodesic.mathdoc.fr/item/DM_2012_24_4_a4/