Weakly semirecursive sets

DOI10.2307/2274653zbMath0702.03020OpenAlexW1994456668MaRDI QIDQ3480024

James C. jun. Owings, Carl G. jun. Jockusch

Publication date: 1990

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274653

zbMATH Keywords

Turing degreesweakly semirecursive setsrecursive approximationssemi-recursively enumerable set

Mathematics Subject Classification ID

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

Related Items (5)

Lower semilattices of separable congruences of numbered algebras ⋮ Almost semirecursive sets ⋮ Structural properties of \(Q\)-degrees of n-c.e. sets ⋮ Weakly semirecursive sets and r.e. orderings ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• Nondeterministic bounded query reducibilities
• A cardinality version of Beigel's nonspeedup theorem

This page was built for publication: Weakly semirecursive sets