Negative Dense Linear Orders
- 1 Downloads
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.
Keywordsenumerated 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
Unable to display preview. Download preview PDF.
- 1.Ershov Yu. L., The Theory of Enumerations [Russian], Nauka, Moscow (1977).Google Scholar
- 2.Ershov Yu. L., Decidability Problems and Constructive Models [Russian], Nauka, Moscow (1980).Google Scholar
- 3.Goncharov S. S. and Ershov Yu. L., Constructive Models (ser. Siberian School of Algebra and Logic), Kluwer Academic/Plenum Publishers, New York, etc. (2000).Google Scholar