Sets with no subset of higher degree

DOI10.2307/2270981zbMath0182.01602OpenAlexW2058683290MaRDI QIDQ5573379

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

Related Items (13)

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

Cites Work

• Unnamed Item

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