Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. M. R. Arslanov, R.F. Nadirov and V.D. Solovev, Completeness criteria for recursively enumerable sets and some general theorems on fixed points, Matematica University News, 1977 (179) No, 4.
2. J. Dekker, A theorem on hypersimple sets, Proc. Amer. Math.Soc. , 5(1954), 791–796.
3. R. M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Natl. Acad. Sciences, U.S.A., 43 (1957), 236–238. MR 18, 867.
4. A. H. Lachlan, Lower bounds for pairs of r.e. degrees, Proc. London Math. Soc. (3), 16 (1966), 537–569. MR 34 no. 4126.
5. ————, Complete recursively enumerable sets, Proc. Amer. Math Soc, 19 (1968), 99–102.