Joining to High Degrees

DOI10.1007/978-3-540-69407-6_40MaRDI QIDQ3507451zbMATH OpenOpenAlexFDO

Authors Jiang Liu, Guohua Wu

Publication date 19 June 2008

Published in Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69407-6_40

Mathematics Subject Classification ID

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

Recommendations

• Joining to high degrees via noncuppables
• Strong noncuppability in low computably enumerable degrees
• A join theorem for the computably enumerable degrees
• Cupping and jump classes in the computably enumerable degrees
• A hierarchy for the plus cupping Turing degrees

Cites work

• A join theorem for the computably enumerable degrees
• An almost deep degree
• scientific article; zbMATH DE number 3784863 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• Joining to high degrees via noncuppables
• Quasi-complements of the cappable degrees

Cited in

(7)

• Highness, locally noncappability and nonboundings
• Joining to high degrees via noncuppables
• A high c.e. degree which is not the join of two minimal degrees
• A note on the join property
• Quasi-complements of the cappable degrees
• A join theorem for the computably enumerable degrees
• Cupping and jump classes in the computably enumerable degrees

This page was built for publication: Joining to High Degrees

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