Characterizing the continuous degrees
Characterizing the continuous degrees
复制标题
表征连续度
DOI:
10.1007/s11856-019-1943-x
复制
发表时间:
2019
影响因子:
1
通讯作者:
Soskova, Mariya I.
中科院分区:
文献类型:
--
作者:
Andrews, Uri;Igusa, Gregory;Miller, Joseph S.;Soskova, Mariya I.
The continuous degrees measure the computability-theoretic content of elements of computable metric spaces. They properly extend the Turing degrees and naturally embed into the enumeration degrees. Although nontotal (i.e., non-Turing) continuous degrees exist, they are all very close to total: joining a continuous degree with a total degree that is not below it always results in a total degree. We call this property almost totality.We prove that the almost total degrees coincide with the continuous degrees. Since the total degrees are definable in the partial order of enumeration degrees [1], we see that the continuous degrees are also definable. Applying earlier work on the continuous degrees [10], this shows that the relation “PA above” on the total degrees is definable in the enumeration degrees.In order to prove that every almost total degree is continuous, we pass through another characterization of the continuous degrees that slightly simplifies one of Kihara and Pauly [7]. We prove that the enumeration degree ofAis continuous if and only ifAis codable, meaning thatAis enumeration above the complement of an infinite tree, every path of which enumeratesA.
登录
查看更多内容
影响因子:
1.1
作者:
P. Gács
通讯作者:
P. Gács
DOI:
--
发表时间:
2013
期刊:
影响因子:
--
作者:
A. Day;Joseph S. Miller
通讯作者:
Joseph S. Miller
DOI:
--
发表时间:
1959
期刊:
影响因子:
--
作者:
R. Friedberg;H. Rogers
通讯作者:
H. Rogers
DOI:
--
发表时间:
--
期刊:
影响因子:
--
作者:
A. Tychonoff
通讯作者:
A. Tychonoff
DOI:
--
发表时间:
1971
期刊:
影响因子:
--
作者:
A. Selman
通讯作者:
A. Selman