|
This article is cited in 10 scientific papers (total in 10 papers)
Negative dense linear orders
N. Kh. Kasymov, R. N. Dadazhanov Uzbekistan National University, Tashkent, Uzbekistan
Abstract:
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.
Keywords:
enumerated systems and morphisms, negative and positive linear orders, computable sequences and sections, productivity of computable sections, computable completion, negative representation of the field of rational numbers.
Received: 16.01.2017
Citation:
N. Kh. Kasymov, R. N. Dadazhanov, “Negative dense linear orders”, Sibirsk. Mat. Zh., 58:6 (2017), 1306–1331; Siberian Math. J., 58:6 (2017), 1015–1033
Linking options:
https://www.mathnet.ru/eng/smj2940 https://www.mathnet.ru/eng/smj/v58/i6/p1306
|
Statistics & downloads: |
Abstract page: | 252 | Full-text PDF : | 125 | References: | 52 | First page: | 8 |
|