On the Cantor-Bendixon rank of recursively enumerable sets

DOI10.2307/2275223MaRDI QIDQ3138017zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

rankTuring degreerecursive ordinalrecursively enumerable degreesCantor-Bendixson rank of r.e. setsretraceable setwtt degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Rank, join, and Cantor singletons
• scientific article; zbMATH DE number 4057497
• Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory
• On the ranked points of a Π₁⁰ set
• Members of countable \(\Pi ^ 0_ 1\) classes

Cites work

• Countable thin ^0_1 classes
• Members of countable \(\Pi ^ 0_ 1\) classes
• On \(\Pi{}^ 0_ 1\) classes and their ranked points
• Retraceable Sets

Cited in

(10)

• Rank, join, and Cantor singletons
• scientific article; zbMATH DE number 4127188 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 3878379 (Why is no real title available?)

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)