scientific article; zbMATH DE number 4135928

MaRDI QIDQ3469098zbMATH OpenFDO

Authors Dechen Ding

Publication date 1989

zbMATH Keywords

wtt-degrees\(O\)-Priority Argumentlow r.e. setMonster MethodRobinson Technique

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
• scientific article; zbMATH DE number 3997772
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Infimum properties differ in the weak truth-table degrees and the Turing degrees
• Wtt-degrees and T-degrees of r.e. sets

Cited in

(2)

• A tt version of the Posner-Robinson theorem
• scientific article; zbMATH DE number 3997772 (Why is no real title available?)

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 Q3469098)