论文标题
相对可计算分类的程度注释
Notes on degrees of relative computable categoricity
论文作者
论文摘要
我们正在研究可计算结构相对可计算的分类性的程度，即在结构的所有不可计算的副本中计算分类。与可计算分类的程度不同，我们可以通过Oracle 0”来绑定相对可计算分类的可能程度。在刚性结构的情况下，界限实际上是0'。这些估计是精确的，特别是我们可以构建一个可计算的结构，该结构仅在上述0英尺的程度上相对可计算地分类。
We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the possible degrees of relative computable categoricity by the oracle 0". In the case of rigid structures the bound is in fact 0'. These estimations are precise, in particular we can build a computable structure which is relatively computably categorical only in the degrees above 0".
