Optimal bounds for ordinal comparison maps
From MaRDI portal
Publication:3737421
DOI10.1007/BF02007560zbMath0602.03011MaRDI QIDQ3737421
Publication date: 1985
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138041
03E15: Descriptive set theory
03D30: Other degrees and reducibilities in computability and recursion theory
03E10: Ordinal and cardinal numbers
03D55: Hierarchies of computability and definability
Related Items
Cites Work
- Unnamed Item
- Members of countable \(\Pi ^ 0_ 1\) classes
- On Recursive Trees with a Unique Infinite Branch
- Recursive well-orderings
- On the Borel class of the derived set operator. II
- A recursion theoretic analysis of the clopen Ramsey theorem
- A generalization of the limit lemma and clopen games
- Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy
- Recursive well-founded orderings
- Number theoretic concepts and recursive well-orderings