1. H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
2. A. N. Degtev, Recursive-Countable Setse and Reducilibities of Tabular Kind (Fizmatlit, Moscow, 1998).
3. P. Odifreddi, “Strong reducibilities,” Bull. Am. Math. Soc. 4, 37–86 (1981).https://doi.org/10.1090/S0273-0979-1981-14863-1
4. S. A. Cook, “The complexity of theorem-proving procedures,” in STOC ’71: Proc. Third Annu. ACM Symp. on Theory of Computing, Shaker Heights, Ohio,
1971 (Association for Computing Machinery, New York, 1971), pp. 151–158. https://doi.org/10.1145/800157.805047
5. Reducibility among combinatorial problems;R. M. Karp,1972