Bounding computably enumerable degrees in the Ershov hierarchy

DOI10.1016/j.apal.2005.10.004zbMath1100.03032OpenAlexW2067769900MaRDI QIDQ2498901

Guohua Wu, Yue Yang, Ang Sheng Li

Publication date: 16 August 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.10.004

zbMATH Keywords

recursively enumerable setsTuring degreesErshov hierarchydegrees of d.r.e. setsdifferences of r.e. setshigh Turing degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (1)

Extending and interpreting Post's programme

Cites Work

• Unnamed Item
• Unnamed Item
• The density of the low\(_ 2\) \(n\)-r.e. degrees
• The d.r.e. degrees are not dense
• Isolation and the high/low hierarchy
• The existence of high nonbounding degrees in the difference hierarchy
• Isolation and the Jump Operator
• D.R.E. Degrees and the Nondiamond Theorem
• Minimal pairs and high recursively enumerable degrees
• Isolation and lattice embeddings

This page was built for publication: Bounding computably enumerable degrees in the Ershov hierarchy