On Recursive Trees with a Unique Infinite Branch

DOI10.2307/2044774MaRDI QIDQ3041176zbMATH OpenOpenAlexFDO

Authors Peter Clote

Publication date 1985

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

zbMATH Keywords

Cantor-Bendixson derivative operation on treesCantor-Bendixson rankhyperarithmeticinfinite branchrecursive treeTuring degreewell-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)

Cites work

• Countable retracing functions and _2⁰ predicates
• Recursive well-founded orderings

Cited in

(4)

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

This page was built for publication: On Recursive Trees with a Unique Infinite Branch

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