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

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

Cited in

(18)

• Complexity properties of recursively enumerable sets and sQ-completeness
• On \(sQ\)-completeness of recursively enumerable sets
• On speedable and levelable vector spaces
• sQ₁-degrees of computably enumerable sets
• Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
• A Reducibility Condition for Recursiveness
• Recursively enumerable sets and degrees
• \(Q _{1}\)-degrees of c.e. sets
• Immunity properties and strong positive reducibilities
• Complexity properties of recursively enumerable sets and bsQ-completeness
• r‐Maximal sets and Q1,N‐reducibility
• On bQ₁-degrees of c.e. sets
• On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees
• On minimal pairs of quasi-degrees
• Non-empty open intervals of computably enumerable sQ₁-degrees
• The singleton degrees of the \({\Sigma}_2^0\) sets are not dense
• Every nonzero enumeration degree contains infinitely many singleton degrees
• Strong enumeration reducibilities

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)