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.
Fulltext:
PDF file (418 kB)
