Optimal bounds for ordinal comparison maps

DOI10.1007/BF02007560MaRDI QIDQ3737421zbMATH OpenFDO

Authors 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

hyperarithmetical hierarchyorder typerecursively presented well-orderings

Mathematics Subject Classification ID

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

Recommendations

• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Ordinal complexity of recursive definitions
• Turing complexity of the ordinals
• On effective linearly ordered sets of comparison functions
• scientific article; zbMATH DE number 4016888

Cites work

• A generalization of the limit lemma and clopen games
• A recursion theoretic analysis of the clopen Ramsey theorem
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Members of countable \(\Pi ^ 0_ 1\) classes
• Number theoretic concepts and recursive well-orderings
• On Recursive Trees with a Unique Infinite Branch
• On the Borel class of the derived set operator. II
• Recursive well-founded orderings
• Recursive well-orderings
• Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy

Cited in

(4)

• The metamathematics of scattered linear orderings
• Comparability invariance results for tolerance orders
• On bi-embeddable categoricity of algebraic structures
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))

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

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