Sets with no subset of higher degree
From MaRDI portal
Publication:5573379
DOI10.2307/2270981zbMath0182.01602MaRDI QIDQ5573379
Publication date: 1969
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270981
Related Items
Hyperarithmetically Encodable Sets, Borel sets and Ramsey's theorem, Encodability of Kleene's O, Computing sets from all infinite subsets, Cohesive avoidance and strong reductions, Degrees of sets having no subsets of higher m- and t t-degree, Genericity for Mathias forcing over general Turing ideals, Upward closure and cohesive degrees, Generics for computable Mathias forcing, Sets without subsets of higher many-one degree, Low sets without subsets of higher many-one degree, Rich Sets, Sets which do not have subsets of every higher degree
Cites Work