论文信息 - An Extended Lachlan Splitting Theorem - 字舞流文

An Extended Lachlan Splitting Theorem

Abstract We show that the top of any diamond with bottom 0 in the r.e. degrees is also the top of a stack of n diamonds with bottom 0 .

Steffen Lempp | Yuefei Sui

[1] Alistair H. Lachlan,et al. Lower Bounds for Pairs of Recursively Enumerable Degrees , 1966 .

[2] Robert I. Soare,et al. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees , 1984 .

[3] Richard E. Ladner,et al. The weak truth table degrees of recursively enumerable sets , 1975 .

[4] Michael Stob. Wtt-Degrees and T-Degrees of R.E. Sets , 1983, J. Symb. Log..

[5] A. H. Lachlan. Decomposition of recursively enumerable degrees , 1980 .

[6] Rodney G. Downey,et al. Highness and Bounding Minimal Pairs , 1993, Math. Log. Q..

[7] C. E. M. Yates. A Minimal Pair of Recursively Enumerable Degrees , 1966, J. Symb. Log..