On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy

Lobachevskii Journal of Mathematics（2018）

引用 2|浏览2

暂无评分

摘要

Questions of definability of computably enumerable degrees in the difference hierarchy (degrees of sets from finite levels of the Ershov difference hierarchy) are studied. Several approaches to the solution of this problem are outlined.

查看译文

关键词

Difference hierarchy,Turing degrees,definable relations,structural properties

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要