Abstract
We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have