Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy

DOI10.1016/0003-4843(75)90005-4zbMath0309.02050OpenAlexW2031786462MaRDI QIDQ4067088

Joseph G. Rosenstein, Louise Hay, Alfred B. Manaster

Publication date: 1975

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

Full work available at URL: https://doi.org/10.1016/0003-4843(75)90005-4

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)

Related Items (3)

Optimal bounds for ordinal comparison maps ⋮ Borel ideals vs. Borel sets of countable relations and trees ⋮ Index Sets and Boolean Operations

This page was built for publication: Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy