Buevich V A

Publications in Math-Net.Ru

1. 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
2. A problem of completeness of $\mathrm{S}$-sets of deterministic functions
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2008, no. 5,  57–59
3. The completeness criterion for systems containing all one-place bounded-determinate functions
   
   Diskr. Mat., 12:4 (2000),  138–158
4. A variant of the proof of a completeness criterion for functions of $k$-valued logic
   
   Diskr. Mat., 8:4 (1996),  11–36
5. On $\tau$-completeness in the class of determinate functions
   
   Dokl. Akad. Nauk, 326:3 (1992),  399–403
6. On $\tau$-completeness in the class of automata mappings
   
   Dokl. Akad. Nauk SSSR, 252:5 (1980),  1037–1041
7. On the algorithmic undecidability of $A$-completeness for the boundedly determinate functions
   
   Mat. Zametki, 11:6 (1972),  687–697