Abstract
In (1, §§ 2.3 and 2.4) we proved that certain distributive lattices are simultaneously lattice-embeddable in the degrees of recursive unsolvability and in the hyperdegrees. Let ℒ be the non-distributive lattice {0,1, a0, a1,…}, where ai ∪ aj = 1 and ai ∩ aj = 1 whenever i ≠ j. We shall prove the following theorem.THEOREM. The lattice ℒ is simultaneously lattice-embeddable in the degrees and hyperdegrees.For A ⊆ N, let deg(A) and hyp(A) be the degree and hyperdegree of A, respectively. To prove the theorem we must construct hyperarithmetically incomparable sets A0, A1, … such that for Δ = deg, hypand for all distinct i, j:12Now, if each 〈Ai, Aj〉 were a generic pair in the sense of (1), then (2) would hold.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
