On subcreative sets and S-reducibility

DOI10.2307/2272852MaRDI QIDQ4049050zbMATH OpenOpenAlexFDO

Authors John Gill, Paul H. Morris

Publication date 1975

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2272852

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Some Notions of Reducibility and Productiveness

Cited in

(13)

• Complexity properties of recursively enumerable sets and \(bsQ\)-completeness
• On speedable and levelable vector spaces
• Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
• On \(sQ\)-completeness of recursively enumerable sets
• A Reducibility Condition for Recursiveness
• Recursively enumerable sets and degrees
• \(sQ_1\)-degrees of computably enumerable sets
• Strong enumeration reducibilities
• r‐Maximal sets and Q1,N‐reducibility
• \(Q _{1}\)-degrees of c.e. sets
• Immunity properties and strong positive reducibilities
• On \(bQ_1\)-degrees of c.e. sets
• Complexity properties of recursively enumerable sets and \(sQ\)-completeness

This page was built for publication: On subcreative sets and S-reducibility

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