Lowness for isomorphism, countable ideals, and computable traceability

MATHEMATICAL LOGIC QUARTERLY(2020)

引用 1|浏览7
暂无评分
摘要
We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune free degrees, lowness for isomorphism is entirely independent of computable traceability.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要