Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory

DOI10.3233/COM-180187MaRDI QIDQ5131644zbMATH OpenOpenAlexFDO

Authors Reese Johnston

Publication date 9 November 2020

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-180187

zbMATH Keywords

computabilitypoint-set topologyadmissible recursion theory

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15)

Recommendations

• On the Cantor-Bendixon rank of recursively enumerable sets
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
• Members of countable \(\Pi ^ 0_ 1\) classes
• On the ranked points of a Π₁⁰ set
• Rank, join, and Cantor singletons

Cited in

(2)

• On the Cantor-Bendixson rank of a set that is searchable in Gödel's \(T\)
• On the Cantor-Bendixon rank of recursively enumerable sets

This page was built for publication: Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131644)