Author:
Talipova A. I.,Yamaleev M. M.
Reference5 articles.
1. R. I. Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic (Springer, Berlin, 1999).
2. R. Downey and M. Stob, “Splitting theorems in recursion theory,” Ann. Pure Appl. Logic 65, 1–106 (1993). https://doi.org/10.1016/0168-0072(93)90234-5
3. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
4. B. Cooper and A. Li, “Non-uniformity and generalized Sacks splitting,” Acta Math. Sinica 18, 327–334 (2002). https://doi.org/10.1007/s101140100150
5. M. M. Arslanov, I. Sh. Kalimullin, and S. Lempp, “On Downey’s conjecture,” J. Symbolic Logic 75, 401–441 (2010). https://doi.org/10.2178/jsl/1268917488