On the Cantor-Bendixon rank of recursively enumerable sets
From MaRDI portal
Publication:3138017
DOI10.2307/2275223zbMATH Open0782.03021OpenAlexW2060348381MaRDI QIDQ3138017FDOQ3138017
Authors: Peter A. Cholak, Rodney G. Downey
Publication date: 24 October 1993
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275223
Recommendations
rankTuring degreerecursive ordinalrecursively enumerable degreesCantor-Bendixson rank of r.e. setsretraceable setwtt degree
Cites Work
Cited In (10)
- Rank, join, and Cantor singletons
- Title not available (Why is that?)
- On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\)
- The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
- Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory
- Rank and randomness
- Degrees containing members of thin \(\Pi_1^0\) classes are dense and co-dense
- The dense simple sets are orbit complete with respect to the simple sets
- A rank one cohesive set
- Title not available (Why is that?)
This page was built for publication: On the Cantor-Bendixon rank of recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138017)