1. V. K. Bulitko, “Reducibility by linear Zhegalkin tables” Sib. Mat. Zh.,21, No. 3, 23–31 (1980).
2. A. N. Degtev, “Hypersimple sets with retraceable complements” Algebra Logika,10, 235–246 (1971).
3. A. N. Degtev, “Reducibilities of tabular type in the theory of algorithms” Usp. Mat. Nauk,34, No. 3, 137–168 (1979).
4. Yu. L. Ershov, “Positive equivalences” Algebra Logika,10, 620–650 (1971).
5. G. N. Kobzev, “The complete Btt-degree” Algebra Logika,13, 22–25 (1974).