Branching degrees above low degrees
暂无分享,去创建一个
[1] Robert I. Soare,et al. Computational complexity, speedable and levelable sets , 1977, Journal of Symbolic Logic.
[2] Alistair H. Lachlan,et al. Lower Bounds for Pairs of Recursively Enumerable Degrees , 1966 .
[3] S. K. Thomason. Sublattices of the Recursively Enumerable Degrees , 1971 .
[4] Robert W. Robinson,et al. Interpolation and Embedding in the Recursively Enumerable Degrees , 1971 .
[5] G. Sacks. Degrees of unsolvability , 1965 .
[6] Robert I. Soare,et al. The infinite injury priority method , 1976, Journal of Symbolic Logic.
[7] A. Lachlan. A recursively enumerable degree which will not split over all lesser ones , 1976 .
[8] A. H. Lachlan. Decomposition of recursively enumerable degrees , 1980 .
[9] Robert I. Soare. Recursion Theory: its Generalisations and Applications: Fundamental Methods for Constructing Recursively Enumerable Degrees , 1980 .
[10] Peter A. Fejer. The density of the nonbranching degrees , 1983, Ann. Pure Appl. Log..
[11] C. E. M. Yates. A Minimal Pair of Recursively Enumerable Degrees , 1966, J. Symb. Log..