On suborderings of the α-recursively enumerable α-degrees
From MaRDI portal
Publication:5677471
DOI10.1016/0003-4843(72)90005-8zbMath0262.02038OpenAlexW2012561888MaRDI QIDQ5677471
Publication date: 1972
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(72)90005-8
Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
An extension of the nondiamond theorem in classical and α-recursion theory ⋮ Reverse Mathematics: The Playground of Logic ⋮ On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0′ ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator ⋮ The theory of the \(\alpha \) degrees is undecidable ⋮ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics ⋮ On generalized computational complexity ⋮ A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions ⋮ Least upper bounds for minimal pairs of α-R.E. α-degrees
