Negative Dense Linear Orders
N. Kh. KasymovUzbekistan National University, Tashkent, UzbekistanR. N. DadazhanovUzbekistan National University, Tashkent, Uzbekistan
ABI
Аннотация
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.
Темы
Идентификаторы
Цитирования и источники
Показатели — AkademScholar · Скоро