TY  - JOUR
AU  - V. A. Buevich
TI  - On the algorithmic undecidability of $A$-completeness for the boundedly determinate functions
JO  - Matematičeskie zametki
PY  - 1972
SP  - 687
EP  - 697
VL  - 11
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1972_11_6_a9/
LA  - ru
ID  - MZM_1972_11_6_a9
ER  -