Highness and Bounding Minimal Pairs

@article{Lempp1993HighnessAB,
  title={Highness and Bounding Minimal Pairs},
  author={Steffen Lempp and Rodney G. Downey and Richard A. Shore},
  journal={Math. Log. Q.},
  year={1993},
  volume={39},
  pages={475-491}
}
We show the existence of a high r.e. degree bounding only joins of minimal pairs and of a high 2 nonbounding r.e. degree. 

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Automorphisms of the lattice of recursively enumerable sets: orbits

  • R. Downey, M. Stob
  • Advances in Math. 92
  • 1992
Highly Influential
13 Excerpts

Tree arguments in recursion theory and the 0 000 priority method

  • R. I. Soare
  • in: \Recursion Theory", A. Nerode and R.A. Shore…
  • 1985
Highly Influential
7 Excerpts

A recursively enumerable degree which will not split over all lesser ones

  • A. H. Lachlan
  • Ann. Math. Logic 9
  • 1975
Highly Influential
8 Excerpts

Notes on the 0 000 priority method with special attention to density arguments

  • R. Downey
  • in: \Recursion Theory Week", Proceedings…
  • 1990
1 Excerpt

Degrees of classes of r.e

  • J. R. Shoen eld
  • sets, J. Symbolic Logic
  • 1976

Notes on the 0 ′ ′ ′ priority method with special attention to density arguments , in : “ Recursion Theory Week ”

  • R. Downey
  • 1974

Similar Papers

Loading similar papers…