Negative Dense Linear Orders


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Considering dense linear orders, we establish their negative representability over every infinite negative equivalence, as well as uniformly computable separability by computable gaps and the productivity of the set of computable sections of their negative representations. We construct an infinite decreasing chain of negative representability degrees of linear orders and prove the computability of locally computable enumerations of the field of rational numbers.

作者简介

N. Kasymov

Uzbekistan National University

编辑信件的主要联系方式.
Email: nadim59@mail.ru
乌兹别克斯坦, Tashkent

R. Dadazhanov

Uzbekistan National University

Email: nadim59@mail.ru
乌兹别克斯坦, Tashkent

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017