1. Soare R. I., Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Springer, Heidelberg (1987).
2. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
3. Ershov Yu. L., The Theory of Enumerations, Nauka, Moscow (1977) [Russian].
4. Ershov Yu. L., Decision Problems and Constructive Models, Nauka, Moscow (1980) [Russian].
5. Ershov Yu. L. and Goncharov S. S., Constructive Models, Kluwer Academic/Plenum, New York, etc. (2000) (Siberian School of Algebra Logic).