Publisher
Springer Nature Switzerland
Reference9 articles.
1. Lecture Notes in Computer Science;R Bie,2007
2. Cooper, S.B.: On a theorem of C. E. M. Yates. Handwritten Notes (1974)
3. Downey, R., Greenberg, N., Miller, J.S., Weber, R.: Prompt simplicity, array computability and cupping. Computational Prospects of Infinity. Part II. Presented Talks, Lecture Notes Series, vol. 15, pp. 59–77. World Scientific Publishing, Hackensack (2008)
4. Greenberg, N., Ng, K.M., Wu, G.: Cupping and jump classes in the computably enumerable degrees. J. Symbolic Logic 85(4), 1499–1545 (2020)
5. Lecture Notes in Computer Science;A Li,2006