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

DOI10.1215/00294527-2009-022zbMath1202.03049OpenAlexW2065701281MaRDI QIDQ987940

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

maximalityTuring degreeshyperhypersimplicitysemi-hyperhypersimple computably enumerable sets

Mathematics Subject Classification ID

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

Related Items (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