Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. S. B. Cooper, Minimal pairs and high recursively enumerable degrees, J. Symbolic Logic 39 (1974), 655–660.
2. P. A. Fejer, The structure of definable subclasses of the recursively enumerable degrees, Ph.D. Dissertation, University of Chicago, 1980.
3. P. A. Fejer and R. I. Soare, The plus-cupping theorem for the recursively enumerable degrees, these Proceedings.
4. R. M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Natl. Acad. Sciences, U.S.A. 43 (1957), 236–238.
5. A. H. Lachlan, Lower bounds for pairs of r.e. degrees, Proc. London Math. Soc. (3) 16 (1966), 537–569.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献