scientific article; zbMATH DE number 2152685

zbMATH Open1071.03025MaRDI QIDQ4664253FDOQ4664253

Authors: Kejia Ho, Frank Stephan 

Publication date: 5 April 2005

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

reducibilitydegreesimple setbounded class of computably enumerable sets

Mathematics Subject Classification ID

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

Cited In (2)

• Invariant Constructions of Simple and Maximal Sets
• Title not available (Why is that?)

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)