Isolation and the high/low hierarchy

DOI10.1007/s001530100111zbMath1028.03035OpenAlexW2014247151MaRDI QIDQ1407540

Guohua Wu, Sh. T. Ishmukhametov

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530100111

zbMATH Keywords

computably enumerable degreescomputably enumerable setsd.c.e. degreesdifference of c.e. sets

Mathematics Subject Classification ID

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

Related Items (8)

Bi-isolation in the d.c.e. degrees ⋮ The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees ⋮ Extending and interpreting Post's programme ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Isolation in the CEA hierarchy ⋮ Bounding computably enumerable degrees in the Ershov hierarchy ⋮ Nonisolated degrees and the jump operator ⋮ The existence of high nonbounding degrees in the difference hierarchy

This page was built for publication: Isolation and the high/low hierarchy