Weakly semirecursive sets

DOI10.2307/2274653MaRDI QIDQ3480024zbMATH OpenOpenAlexFDO

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

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

recursive approximationssemi-recursively enumerable setTuring degreesweakly semirecursive sets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5062001
• Weakly semirecursive sets and r.e. orderings
• A class of enumerable sets
• Almost semirecursive sets
• scientific article; zbMATH DE number 4051595

Cites work

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

Cited in

(12)

• Weakly semirecursive sets and r.e. orderings
• Recursion theoretic properties of frequency computation and bounded queries
• Almost semirecursive sets
• scientific article; zbMATH DE number 3850054 (Why is no real title available?)
• scientific article; zbMATH DE number 4051595 (Why is no real title available?)
• scientific article; zbMATH DE number 1285474 (Why is no real title available?)
• A variant of the Notion of Semicreative set
• Almost weakly 2-generic sets
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Lower semilattices of separable congruences of numbered algebras
• Unoids with finiteness conditions over computably separable equivalences
• Structural properties of \(Q\)-degrees of n-c.e. sets

This page was built for publication: Weakly semirecursive sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480024)