Recursive well-founded orderings

DOI10.1016/0003-4843(78)90001-3MaRDI QIDQ4163203zbMATH OpenOpenAlexFDO

Authors Keh-Hsun Chen

Publication date 1978

Published in Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0003-4843(78)90001-3

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(6)

• Borel ideals vs. Borel sets of countable relations and trees
• Embeddings between well-orderings: computability-theoretic reductions
• On Recursive Trees with a Unique Infinite Branch
• A recursion theoretic analysis of the clopen Ramsey theorem
• Optimal bounds for ordinal comparison maps
• On the ranked points of a Π₁⁰ set

This page was built for publication: Recursive well-founded orderings

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