The existence of high nonbounding degrees in the difference hierarchy

DOI10.1016/J.APAL.2005.06.005zbMath1093.03028OpenAlexW2012028750MaRDI QIDQ2576939

Ang Sheng Li, Chi Tat Chong, Yue Yang

Publication date: 29 December 2005

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.06.005

zbMATH Keywords

Ershov hierarchyjump classesd.c.e. degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Bounding computably enumerable degrees in the Ershov hierarchy

Cites Work

• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• Infima in the d.r.e. degrees
• Isolation and the high/low hierarchy
• The discontinuity of splitting in the recursively enumerable degrees
• Definability in the Recursively Enumerable Degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• Bounding minimal pairs
• Minimal pairs and high recursively enumerable degrees
• Working below a high recursively enumerable degree

This page was built for publication: The existence of high nonbounding degrees in the difference hierarchy