Sets with no subset of higher degree

DOI10.2307/2270981zbMATH Open0182.01602OpenAlexW2058683290MaRDI QIDQ5573379FDOQ5573379

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

Cites Work

• Title not available (Why is that?)

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
• Rich Sets
• Sets without subsets of higher many-one degree
• Degrees of sets having no subsets of higher m- and t t-degree
• Cohesive avoidance and strong reductions
• Genericity for Mathias forcing over general Turing ideals

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)