The Density of Infima in the Recursively Enumerable Degrees

  title={The Density of Infima in the Recursively Enumerable Degrees},
  author={Theodore A. Slaman},
  journal={Ann. Pure Appl. Logic},
Slaman, T.A., The density of infima in the recursively enumerable degrees, Annals of Pure and Applied Logic 52 (1991) 155-179. We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees. Theorem. Zf A and E are recursively enumerable sets such that A >= E, then there are recursively enumerable sets B, C and D such that: (1) A + B, A + C. (2) B>,D, C>,D. (3) Da, E. (4) For sets X, if X is… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-4 of 4 references

Decomposition of recursively enumerable degrees

A. H. Lachlan
Proc. Amer. Math. Sot • 1980

The structure of definable subclasses of the recursively enumerable degrees

P. Fejer
Ph.D. Dissertation, University of Chicago, • 1980

Understanding Lachlan ’ s monster paper , Handwritten notes

L. A. Harrington

The recursively enumerable degrees are dense

G. E. Sacks
Ann. of Math • 1964

Similar Papers

Loading similar papers…