On the degrees of diagonal sets and the failure of the analogue of a theorem of Martin

DOI10.1215/00294527-2009-022MaRDI QIDQ987940zbMATH OpenOpenAlexFDO

Authors Keng Meng Ng

Publication date 2 September 2010

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1215/00294527-2009-022

zbMATH Keywords

hyperhypersimplicitymaximalitysemi-hyperhypersimple computably enumerable setsTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• Diagonals and semihyperhypersimple sets
• Subsets of hypersimple sets
• Hypersimplicity and semicomputability in the weak truth table degrees
• \(Q _{1}\)-degrees of c.e. sets
• Diagonals and -maximal sets

Cited in

(1)

• Splitting into degrees with low computational strength

This page was built for publication: On the degrees of diagonal sets and the failure of the analogue of a theorem of Martin

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