On Recursive Trees with a Unique Infinite Branch

DOI10.2307/2044774zbMath0526.03024OpenAlexW4240044395MaRDI QIDQ3041176

Peter Clote

Publication date: 1985

Full work available at URL: https://doi.org/10.2307/2044774

zbMATH Keywords

Turing degreehyperarithmeticrecursive treeCantor-Bendixson rankinfinite branchCantor-Bendixson derivative operation on treeswell-founded part of a tree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Members of countable \(\Pi ^ 0_ 1\) classes ⋮ Optimal bounds for ordinal comparison maps ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Computability of Subsets of Metric Spaces

Cites Work

• Countable retracing functions and \(\Pi_2^0\) predicates
• Recursive well-founded orderings