Negative dense linear orders

DOI10.1134/S0037446617060118zbMath1469.03124OpenAlexW2789583297MaRDI QIDQ1745085

R. N. Dadazhanov, N. Kh. Kasymov

Publication date: 20 April 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446617060118

zbMATH Keywords

morphismscomputable completioncomputable sequences and sectionsenumerated systemsnegative and positive linear ordersnegative representation of the field of rational numbersproductivity of computable sections

Mathematics Subject Classification ID

Total orders (06A05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (6)

Computably separable models ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ Computability and universal determinability of negatively representable models ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Structures of degrees of negative representations of linear orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms onto effectively separable algebras
• Definability of linear orders over negative equivalences
• Algebras over negative equivalences
• \(\Pi^0_1\)-presentations of algebras
• On computable automorphisms of the rational numbers
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Recursively separable enumerated algebras
• CONSTRUCTIVE ALGEBRAS I
• Hierarchies of Boolean algebras

This page was built for publication: Negative dense linear orders