Abelian p-groups and the Halting problem.

Ann. Pure Appl. Logic(2016)

引用 13|浏览33
暂无评分
摘要
We investigate which effectively presented abelian p-groups are isomorphic relative to the halting problem. The standard approach to this and similar questions uses the notion of Δ20-categoricity (to be defined). We partially reduce the description of Δ20-categorical p-groups of Ulm type 1 to the analogous problem for equivalence structures. Using this reduction, we solve a problem left open in [5]. For the sake of the reduction mentioned above, we introduce a new notion of effective Δ20-categoricity that lies strictly in-between plain Δ20-categoricity and relative Δ20-categoricity (to be defined). We then reduce the problem of classifying effective Δ20-categoricity to a question stated in terms of Σ20-sets. Among other results, we show that for c.e. Turing degrees bounding such sets is equal to being complete.
更多
查看译文
关键词
03D45,03C57,20K99,20K10
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要