Definability of linear orders over negative equivalences

DOI10.1007/S10469-016-9373-XzbMath1358.03043OpenAlexW2408136935MaRDI QIDQ321260

N. Kh. Kasymov, Andrey S. Morozov

Publication date: 13 October 2016

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-016-9373-x

zbMATH Keywords

linear ordercomputable automorphismeffectively limit pointpositive and negative presentation

Mathematics Subject Classification ID

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

Related Items (10)

Homomorphisms onto effectively separable algebras ⋮ Computably separable models ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ 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 ⋮ Negative dense linear orders ⋮ Structures of degrees of negative representations of linear orders

Cites Work

• Simple structures with complex symmetry
• On computable automorphisms of the rational numbers
• Recursively separable enumerated algebras
• CONSTRUCTIVE ALGEBRAS I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definability of linear orders over negative equivalences