Low sets without subsets of higher many-one degree
From MaRDI portal
Publication:3096087
DOI10.1002/malq.200920043zbMath1248.03061OpenAlexW1986100491MaRDI QIDQ3096087
Publication date: 7 November 2011
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200920043
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Cites Work
- Unnamed Item
- Upward closure and cohesive degrees
- Polynomial time introreducibility
- Recursively enumerable many-one degrees
- Sets without subsets of higher many-one degree
- Retraceable Sets
- Bi-immune sets for complexity classes
- Sets which do not have subsets of every higher degree
- A cohesive set which is not high
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Sets with no subset of higher degree
- A note on degrees of subsets1