scientific article; zbMATH DE number 3999903

MaRDI QIDQ4726237zbMATH OpenFDO

Authors Paul Fischer

Publication date 1986

zbMATH Keywords

Q-reducibilitywtt-reducibility

Mathematics Subject Classification ID

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

Cited in

(6)

• Computably enumerable sets and quasi-reducibility
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• scientific article; zbMATH DE number 7577584 (Why is no real title available?)
• On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees
• Strong enumeration reducibilities
• Structural properties of \(Q\)-degrees of n-c.e. 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 Q4726237)