Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T02:30:11.996Z Has data issue: false hasContentIssue false

Degrees joining to 0′

Published online by Cambridge University Press:  12 March 2014

David B. Posner
Affiliation:
San Jose State University, San Jose, California 95192
Robert W. Robinson
Affiliation:
University of Newcastle, New South Wales, Australia 2308

Abstract

It is shown that if and are sets of degrees uniformly recursive in 0′ with 0 ∈ then there is a degree b with b′ = 0′, b ∪ c = 0′ for every c ∈ , and a ≰ b for every a ∈ ˜ {0}. The proof is given as an oracle construction recursive in 0′. It follows that any nonrecursive degree below 0′ can be joined to 0′ by a degree strictly below 0′. Also, if a < 0′ and a″ = 0″ then there is a degree b such that a ∪ b = 0′ and a ∩ b = 0.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable