The discontinuity of splitting in the recursively enumerable degrees

• Ambos-Spies, K., Ding, D.: Discontinuity of capping in the recursively enumerable degrees and strongly nonbranching degrees. Math Log Quart40, 287–317 (1994)

  Google Scholar 

• Ambos-Spies, K., Lachlan, A.H., Soare, R.I.: The continuity of cupping to0′. Ann Pure Appl Logic64, 195–209 (1993)

  Article  Google Scholar 

• Ambos-Spies, K., Shore, R.A.: Undecidability and 1-types in the recursively enumerable degrees. Ann Pure Appl Logic63, 3–37 (1993)

  Article  Google Scholar 

• Cooper, S.B.: Discontinuous phenomena and Turing definability. In: Kazan (ed.) Proceedings of the International Conference of Algebra and Analysis. Amsterdam: de Gruyter 1994

  Google Scholar 

• Cooper, S.B., Sui, Y., Yi, X.: Minimal pairs and the Slaman-Soare phenomenon. In preparation

• Harrington, L.A., Soare, R.I.: Games in recursion theory and continuity properties of capping degrees. In: Judah, H., Just, W., Woodin, W.H. (eds.) Set theory and the continuum, pp. 39–62. Berlin Heidelberg New York: Springer 1992

  Google Scholar 

• Lachlan, A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc London Math Soc16, 537–569 (1966)

  Google Scholar 

• Lerman, M.: General ∀∃-decision method for degree structures. Unpublished (1993)

• Sacks, G.E.: On the degrees less than0′. Ann Math77, 211–231 (1963)

  Google Scholar 

• Seetapun, D.: Every recursively enumerable degree is locally noncappable. Preprint

• Soare, R.I.: Recursively enumerable sets and degrees. Perspectives in Mathematical Logic, Omega Series. Berlin Heidelberg New York: Springer 1987

  Google Scholar 

• Stob, M.: wtt-degrees and T-degrees of recursively enumerable sets. J Symb Logic48, 921–930 (1983)

  Google Scholar 

• Yates, C.E.M.: A minimal pair of recursively enumerable degrees. J. Symb Logic31, 159–168 (1966)

  Google Scholar 

Download references