scientific article; zbMATH DE number 2152685

MaRDI QIDQ4664253zbMATH OpenFDO

Authors Kejia Ho, Frank Stephan

Publication date 5 April 2005

zbMATH Keywords

bounded class of computably enumerable setsdegreereducibilitysimple set

Mathematics Subject Classification ID

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

Recommendations

• Classes bounded by incomplete sets
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• On the strongly bounded Turing degrees of simple sets
• Upper bounds on ideals in the computably enumerable Turing degrees
• On bounded m-reducibilities

Cited in

(2)

• scientific article; zbMATH DE number 3557770 (Why is no real title available?)
• Invariant Constructions of Simple and Maximal Sets

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