On the Cantor-Bendixon rank of recursively enumerable sets

DOI10.2307/2275223zbMath0782.03021OpenAlexW2060348381MaRDI QIDQ3138017

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)

Related Items

A rank one cohesive set, Degrees containing members of thin Π10 classes are dense and co-dense, RANK AND RANDOMNESS, The dense simple sets are orbit complete with respect to the simple sets, The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees

Cites Work

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