Negative dense linear orders

DOI10.1134/S0037446617060118MaRDI QIDQ1745085zbMATH OpenOpenAlexFDO

Authors N. Kh. Kasymov, R. N. Dadazhanov

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

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

Recommendations

• Structures of degrees of negative representations of linear orders
• Definability of linear orders over negative equivalences
• Linear orderings of low degree
• On a computable presentation of low linear orderings
• Scattered linear orderings with no computable presentation

Cites work

• scientific article; zbMATH DE number 3779289 (Why is no real title available?)
• scientific article; zbMATH DE number 3534471 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3254884 (Why is no real title available?)
• scientific article; zbMATH DE number 3091018 (Why is no real title available?)
• Algebras over negative equivalences
• CONSTRUCTIVE ALGEBRAS I
• Definability of linear orders over negative equivalences
• Hierarchies of Boolean algebras
• Homomorphisms onto effectively separable algebras
• Linear orders realized by c.e. equivalence relations
• On computable automorphisms of the rational numbers
• Recursively separable enumerated algebras
• Structure characterization of the recursively separable models
• \(\Pi^0_1\)-presentations of algebras

Cited in

(9)

• Uniform \(m\)-equivalencies and numberings of classical systems
• Computably separable models
• Definability of linear orders over negative equivalences
• Computability and universal determinability of negatively representable models
• Computably separable numbering of locally finitely separable algebras
• Lower semilattices of separable congruences of numbered algebras
• Logical specifications of effectively separable data models
• Structures of degrees of negative representations of linear orders
• Separable algorithmic representations of classical systems and their applications

This page was built for publication: Negative dense linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745085)