The structures inside Turing degrees of recursively enumerable generic sets
From MaRDI portal
Publication:687928
zbMATH Open0788.03057MaRDI QIDQ687928FDOQ687928
Authors: Decheng Ding
Publication date: 5 June 1994
Published in: Chinese Science Bulletin (Search for Journal in Brave)
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (13)
- A comparison of frequencies of occurrence of \(p\)-generic and non-\(p\)- generic Turing degrees
- An extension of the recursively enumerable Turing degrees
- Generic amplification of recursively enumerable sets
- Generating sets for the recursively enumerable Turing degrees
- Title not available (Why is that?)
- On the theory of the PTIME degrees of the recursive sets
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory
- A limit on relative genericity in the recursively enumerable sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The structures inside Turing degrees of recursively enumerable generic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687928)