On subcreative sets and S-reducibility
From MaRDI portal
Publication:4049050
DOI10.2307/2272852zbMath0296.02020MaRDI QIDQ4049050
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
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Complexity properties of recursively enumerable sets and \(bsQ\)-completeness, r‐Maximal sets and Q1,N‐reducibility, \(Q _{1}\)-degrees of c.e. sets, Immunity properties and strong positive reducibilities, Strong enumeration reducibilities, Complexity properties of recursively enumerable sets and \(sQ\)-completeness, On \(sQ\)-completeness of recursively enumerable sets, On speedable and levelable vector spaces, \(sQ_1\)-degrees of computably enumerable sets, Hyperhypersimple sets and Q1 -reducibility, Recursively enumerable sets and degrees, A Reducibility Condition for Recursiveness
Cites Work