On the Cantor-Bendixon rank of recursively enumerable sets
From MaRDI portal
Publication:3138017
DOI10.2307/2275223zbMath0782.03021MaRDI 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
rank; Turing degree; recursive ordinal; recursively enumerable degrees; Cantor-Bendixson rank of r.e. sets; retraceable set; wtt degree
03D25: Recursively (computably) enumerable sets and degrees
Related Items
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, A rank one cohesive set, The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
Cites Work