Publications in Math-Net.Ru
-
On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions
Diskr. Mat., 24:4 (2012), 56–69
-
On completeness and $A$-completeness of $S$-sets of determinate functions containing all one-place determinate $S$-functions
Diskr. Mat., 21:2 (2009), 75–87
-
The number of $\mathrm{S}$-precomplete classes in the functional system $P_k^\tau$
Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2009, no. 1, 61–62
-
A problem of completeness of $\mathrm{S}$-sets of deterministic functions
Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2008, no. 5, 57–59
© , 2024