arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1308.6399math.LO
收藏

可计算性理论和复杂性理论中的编码方法

Coding Methods in Computability Theory and Complexity Theory

Andre Nies

摘要:

可计算性理论的一个主要部分集中在对一些重要结构的分析上。作为一种工具,一阶公式编码方法已得到了成功的应用。例如,在C.E.图灵度,它已被用来确定的复杂性的基本理论,提供限制的自同构,甚至获得可定义的结果(工作哈林顿,尼斯,肖尔,斯拉曼,和其他人)。我们描述了一个类似的程序可以进行其他几个结构,包括结构的c. e。多个1度,c.e.弱真假值表度与c.e.集合包含。在所有情况下,我们都将获得结构理论中真算术的不可判定性,甚至是真算术的解释。对于CE。许多一度,我们也得到了可定义性的结果和限制的自同构。这项工作首次出现在海德堡大学,1998年作为作者的毕业论文。

英文摘要:

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees, it has been used to determine the complexity of the elementary theory, to provide restrictions on automorphisms, and even to obtain definability results (work of Harrington, Nies, Shore, Slaman, and others). We describe how a similar program can be carried out for several other structures, including the structure of c.e. many one degrees, the structure of c.e. weak truth table degrees and the lattice of c.e. sets under inclusion. In all cases we will obtain undecidability of, or even an interpretation of true arithmetic in the theory of the structure. For the c.e. many one-degrees, we also obtain definability results and restrictions on automorphisms. This work appeared first as the author's habilitation thesis at the Universitaet Heidelberg, 1998.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑