The recursively enumerable α-degrees are dense

DOI10.1016/0003-4843(76)90007-3zbMATH Open0374.02022OpenAlexW2015329474MaRDI QIDQ4152525FDOQ4152525

Authors Richard A. Shore

Publication date 1976

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

Full work available at URL https://doi.org/10.1016/0003-4843(76)90007-3

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(15)

• Intermediate β-r.e. degrees and the half-jump
• The Sacks density theorem and Σ₂-bounding
• On minimal pairs and minimal degrees in higher recursion theory
• Cohesive Sets: Countable and Uncountable
• The irregular and non-hyperregular \(\alpha\)-r.e. degrees
• Inadmissible recursion theory
• A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions
• A hierarchy of computably enumerable degrees
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0′
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory
• Tabular degrees in \(\alpha\)-recursion theory
• Degree theory on \(\aleph_\omega\)
• Inverting the Half-Jump

This page was built for publication: The recursively enumerable α-degrees are dense

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