A discrete chain of degrees of index sets

DOI10.2307/2272557zbMath0256.02019OpenAlexW2061257995MaRDI QIDQ5670615

Louise Hay

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272557

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Structures of the degrees of unsolvability of index sets ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Index sets in 0' ⋮ Convex subsets of \(2^n\) and bounded truth-table reducibility ⋮ Precomplete numberings

Cites Work

• Unnamed Item
• Computing degrees of unsolvability
• Index sets of finite classes of recursively enumerable sets
• Creative sets