Abstract
In this article, we examine the complexity of three degree structures in terms of the quantity of partial orderings embeddable in them. We prove that every countable partial ordering can be embedded in any interval of enumeration degrees with upper bound, a degree which contains a member with a good approximation. Next we prove that a similar result is true of the ω-enumeration degrees. Finally we consider the structure of the ∑02ω-enumeration degree modulo iterated jump and show that there as well one can embed densely every countable partial ordering.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.