A limit on relative genericity in the recursively enumerable sets

DOI10.2307/2274854zbMath0699.03023OpenAlexW2083502326MaRDI 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

zbMATH Keywords

recursively enumerable setsTuring jumpTuring degreeslow setlow degreedeep degreesjump approximationTuring functionals

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

A join theorem for the computably enumerable degrees ⋮ \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees ⋮ The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility ⋮ An almost deep degree ⋮ Infima in the d.r.e. degrees ⋮ Implicit measurements of dynamic complexity properties and splittings of speedable sets

Cites Work

• The recursively enumerable degrees are dense
• On the degrees less than 0'
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: A limit on relative genericity in the recursively enumerable sets