Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-17T21:59:22.309Z Has data issue: false hasContentIssue false

A limit on relative genericity in the recursively enumerable sets

Published online by Cambridge University Press:  12 March 2014

Steffen Lempp*
Affiliation:
Department of Mathematics, Yale University, New Haven, Connecticut 06520
Theodore A. Slaman
Affiliation:
Department of Mathematics, University of Chicago, Chicago, Illinois 60637
*
Department of Mathematics, University of Wisconsin, Madison, Wisconsin 53706

Abstract

Work in the setting of the recursively enumerable sets and their Turing degrees. A set X is low if X′, its Turing jump, is recursive in ∅′ and high if X′ computes ∅″. Attempting to find a property between being low and being recursive, Bickford and Mills produced the following definition. W is deep, if for each recursively enumerable set A, the jump of A ⊕ W is recursive in the jump of A. We prove that there are no deep degrees other than the recursive one.

Given a set W, we enumerate a set A and approximate its jump. The construction of A is governed by strategies, indexed by the Turing functionals Φ. Simplifying the situation, a typical strategy converts a failure to recursively compute W into a constraint on the enumeration of A, so that (W ⊕ A)′ is forced to disagree with Φ(−;A′). The conversion has some ambiguity; in particular, A cannot be found uniformly from W.

We also show that there is a “moderately” deep degree: There is a low nonzero degree whose join with any other low degree is not high.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1989

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