Bounding minimal degrees by computably enumerable degrees
暂无分享，去创建一个
[1] R. G. Downey. $\Delta^{0}_{2}$ Degrees and transfer theorems , 1987 .
[2] S. Cooper,et al. The jump is definable in the structure of the degrees of unsolvability , 1990 .
[3] C. Jockusch. Degrees of generic sets , 1980 .
[4] G. Sacks. A minimal degree less than 0 , 1961 .
[5] Manuel Lerman,et al. Degrees which do not bound minimal degrees , 1986, Ann. Pure Appl. Log..
[6] Richard L. Epstein,et al. Complementing below recursively enumerable degrees , 1987, Ann. Pure Appl. Log..
[7] Theodore A. Slaman,et al. Definability in the Turing degrees , 1986 .
[8] Rod Downey. D.R.E. Degrees and the Nondiamond Theorem , 1989 .
[9] C. Spector. On Degrees of Recursive Unsolvability , 1956 .
[10] Emil L. Post,et al. The Upper Semi-Lattice of Degrees of Recursive Unsolvability , 1954 .
[11] Angsheng Li,et al. Cupping the Recursively Enumerable Degrees by D.R.E. Degrees , 1999 .
[12] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .
[13] C. Jockusch. Simple Proofs of Some Theorems on High Degrees of Unsolvability , 1977, Canadian Journal of Mathematics.
[14] R. Friedberg,et al. TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). , 1957, Proceedings of the National Academy of Sciences of the United States of America.