Optimal bounds for ordinal comparison maps

DOI10.1007/BF02007560zbMath0602.03011MaRDI QIDQ3737421

Peter Clote

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

zbMATH Keywords

order typehyperarithmetical hierarchyrecursively presented well-orderings

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30) Ordinal and cardinal numbers (03E10) Hierarchies of computability and definability (03D55)

Related Items (1)

The metamathematics of scattered linear orderings

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

This page was built for publication: Optimal bounds for ordinal comparison maps