A join theorem for the computably enumerable degrees

DOI10.1090/S0002-9947-04-03585-8zbMath1057.03030MaRDI QIDQ4813778

Carl G. jun. Jockusch, Yue Yang, Ang Sheng Li

Publication date: 13 August 2004

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

computably enumerable degreeshigh degree\(\text{low}_2\) degree

Mathematics Subject Classification ID

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

Related Items (4)

Joining to High Degrees ⋮ A hierarchy for the plus cupping Turing degrees ⋮ Joining to high degrees via noncuppables ⋮ Elementary differences among jump classes

Cites Work

• Unnamed Item
• An almost deep degree
• A limit on relative genericity in the recursively enumerable sets
• Degrees joining to 0′
• Interpretability and Definability in the Recursively Enumerable Degrees
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable

This page was built for publication: A join theorem for the computably enumerable degrees