On subcreative sets and S-reducibility

DOI10.2307/2272852zbMath0296.02020OpenAlexW2041909100MaRDI QIDQ4049050

Paul H. Morris, John Gill

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)

Related Items (12)

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

Cites Work

• Unnamed Item
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Some Notions of Reducibility and Productiveness

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