THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES

DOI10.1142/S0219061306000505zbMATH Open1109.03040MaRDI QIDQ5485749FDOQ5485749

Authors: Noam Greenberg, Richard A. Shore, Theodore A. Slaman 

Publication date: 4 September 2006

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

Recommendations

• An extension of the recursively enumerable Turing degrees
• The theory of the recursively enumerable weak truth-table degrees is undecidable
• Degree Structures: Local and Global Investigations
• The recursively enumerable degrees have infinitely many one-types
• Undecidability and 1-types in the recursively enumerable degrees

zbMATH Keywords

elementary equivalenceadmissible recursionmetarecursion theorymetarecursively enumerable degreesSlaman-Woodin sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• The constructive second number class
• On notation for ordinal numbers
• On the theory of the PTIME degrees of the recursive sets
• Finite injury and Σ₁-induction
• The recursively enumerable α-degrees are dense
• Some minimal pairs of α-recursively enumerable degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• Metarecursive sets
• The undecidability of the recursively enumerable degrees
• A recursively enumerable degree which will not split over all lesser ones
• Techniques of admissible recursion theory
• The role of true finiteness in the admissible recursively enumerable degrees
• Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}
• On the recursive functions of ordinal numbers
• Metarecursively enumerable sets and their metadegrees
• The irregular and non-hyperregular \(\alpha\)-r.e. degrees
• A formalization of the theory of ordinal numbers
• On homogeneity and definability in the first-order theory of the Turing degrees
• Consistency-Proof for the Generalized Continuum-Hypothesis
• Metarecursively enumerable sets and admissible ordinals

Cited In (3)

• Generating sets for the recursively enumerable Turing degrees
• The theory of the \(\alpha \) degrees is undecidable
• Title not available (Why is that?)

This page was built for publication: THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES

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