Reducibility of Computable Metrics on the Real Line
- 作者: Kornev R.A.1
-
隶属关系:
- Novosibirsk State University
- 期: 卷 56, 编号 4 (2017)
- 页面: 302-317
- 栏目: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/234046
- DOI: https://doi.org/10.1007/s10469-017-9451-8
- ID: 234046
如何引用文章
详细
We study computable reducibility of computable metrics on R induced by reducibility of their respective Cauchy representations. It is proved that this ordering has a subordering isomorphic to an arbitrary countable tree. Also we introduce a weak version of computable reducibility and construct a countable antichain of computable metrics that are incomparable with respect to it. Informally, copies of the real line equipped with these metrics are pairwise homeomorphic but not computably homeomorphic.
作者简介
R. Kornev
Novosibirsk State University
编辑信件的主要联系方式.
Email: kornevrus@gmail.com
俄罗斯联邦, ul. Pirogova 1, Novosibirsk, 630090
补充文件
