1. Arslanov, M.M.: “Local theory of unsolvability degrees and o—sets2-”: KGU press/Kazan, (1987).(In Russian).
2. Rogers, H. Jr.: “Theory of recursive functions and effective comput,ability”; McGrow-Hill/N.-Y. (1967).
3. A.H.Lachlan, A. H.: “Complete recursively enumerable sets”; Proc. Amer. Math. Soc., 19, (1968), 99–102.
4. Bulitko, V. K.: “Subturing reducibilities with bounded complexity”; Izv.VUZov, ser. mat., 1 (1992), 27–37. (In Russian).
5. Bulitko, V. K.: “On some complexity characteristics of Immune sets”; MLQ, 41, 3 (1995) (in press).