Emel'yanov N R

Publications in Math-Net.Ru

1. Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic
   
   Diskr. Mat., 1:2 (1989),  65–77
2. One approach to construction of effective algorithms for recognizing completeness in multivalued logics
   
   Mat. Zametki, 39:5 (1986),  766–775
3. Complexity of the problem of expressibility in many-valued logics
   
   Dokl. Akad. Nauk SSSR, 282:3 (1985),  525–529
4. A method of constructing fast algorithms in the $k$-valued logic
   
   Mat. Zametki, 38:1 (1985),  148–156