THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES

DOI10.1142/S0219061306000505MaRDI QIDQ5485749zbMATH OpenFDO

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)

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)

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

Cites work

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

Cited in

(3)

• Generating sets for the recursively enumerable Turing degrees
• The theory of the degrees is undecidable
• scientific article; zbMATH DE number 1791729 (Why is no real title available?)

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)