Maximal contiguous degrees

DOI10.2178/jsl/1190150052zbMath1007.03041OpenAlexW2007735180MaRDI QIDQ4532623

Peter A. Cholak, Stephen M. Walk, Rodney G. Downey

Publication date: 22 March 2003

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

Full work available at URL: https://doi.org/10.2178/jsl/1190150052

zbMATH Keywords

computably enumerable degreeautomorphism basecontiguous degreearray computable degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ Maximality and collapse in the hierarchy of α-c.a. degrees

Cites Work

• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Structural interactions of the recursively enumerable T- and W-degrees
• Classical recursion theory. Vol. II
• Splitting theorems in recursion theory
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Wtt-degrees and T-degrees of r.e. sets
• Localization of a theorem of Ambos-Spies and the strong anti-splitting property
• The weak truth table degrees of recursively enumerable sets
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• Highness and bounding minimal pairs