Sets with no subset of higher degree

DOI10.2307/2270981MaRDI QIDQ5573379zbMATH OpenOpenAlexFDO

Authors Robert I. Soare

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

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(13)

• Computing sets from all infinite subsets
• Borel sets and Ramsey's theorem
• Upward closure and cohesive degrees
• Generics for computable Mathias forcing
• Low sets without subsets of higher many-one degree
• Encodability of Kleene's O
• Sets which do not have subsets of every higher degree
• Hyperarithmetically Encodable Sets
• Sets without subsets of higher many-one degree
• Rich Sets
• Degrees of sets having no subsets of higher m- and t t-degree
• Genericity for Mathias forcing over general Turing ideals
• Cohesive avoidance and strong reductions

This page was built for publication: Sets with no subset of higher degree

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