scientific article; zbMATH DE number 5354050

MaRDI QIDQ3530399zbMATH OpenFDO

Authors Keng Meng Ng

Publication date 20 October 2008

zbMATH Keywords

Turing degree

Mathematics Subject Classification ID

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

Recommendations

• A hierarchy for cuppable degrees
• Joining to high degrees via noncuppables
• Bounding cappable degrees
• Degrees with almost universal cupping property
• On a hierarchy of plus-cupping degrees
• Degrees which do not bound minimal degrees
• A Contiguous Nonbranching Degree
• A high strongly noncappable degree
• Beyond degree choosability
• Degrees that are not degrees of categoricity

Cited in

(3)

• There is an Sw-Cuppable Strongly c.e. Real
• A high strongly noncappable degree
• A hierarchy for cuppable degrees

This page was built for publication:

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