A limit on relative genericity in the recursively enumerable sets
From MaRDI portal
Publication:3476801
DOI10.2307/2274854zbMath0699.03023MaRDI QIDQ3476801
Steffen Lempp, Theodore A. Slaman
Publication date: 1989
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274854
recursively enumerable sets; Turing jump; Turing degrees; low set; low degree; deep degrees; jump approximation; Turing functionals
03D25: Recursively (computably) enumerable sets and degrees
Related Items
A join theorem for the computably enumerable degrees, Implicit measurements of dynamic complexity properties and splittings of speedable sets, Infima in the d.r.e. degrees, \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees, An almost deep degree, The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
Cites Work