Recursive well-founded orderings
From MaRDI portal
Publication:4163203
DOI10.1016/0003-4843(78)90001-3zbMath0384.03027OpenAlexW2028008720MaRDI QIDQ4163203
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
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items
On Recursive Trees with a Unique Infinite Branch, Optimal bounds for ordinal comparison maps, Borel ideals vs. Borel sets of countable relations and trees, Embeddings between well-orderings: computability-theoretic reductions, On the ranked points of a Π10 set, A recursion theoretic analysis of the clopen Ramsey theorem
