Negative Dense Linear Orders
- Autores: Kasymov N.1, Dadazhanov R.1
-
Afiliações:
- Uzbekistan National University
- Edição: Volume 58, Nº 6 (2017)
- Páginas: 1015-1033
- Seção: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171575
- DOI: https://doi.org/10.1134/S0037446617060118
- ID: 171575
Citar
Resumo
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.
Sobre autores
N. Kasymov
Uzbekistan National University
Autor responsável pela correspondência
Email: nadim59@mail.ru
Uzbequistão, Tashkent
R. Dadazhanov
Uzbekistan National University
Email: nadim59@mail.ru
Uzbequistão, Tashkent