Computability and universal determinability of negatively representable models

DOI10.3103/S1066369X22100036OpenAlexW4321385429MaRDI QIDQ2688330

R. N. Dadazhanov

Publication date: 2 March 2023

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x22100036

zbMATH Keywords

computablenegative and positive diagramnegative and positive representations of modelsstandard enrichmentuniversal and existential determinability

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Model theory (03Cxx) Algebraic structures (08Axx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms onto effectively separable algebras
• Definability of linear orders over negative equivalences
• Positive algebras with congruences of finite index
• Homomorphisms onto negative algebras
• Separation axioms and partitions of the set of natural numbers
• Enumerated algebras with uniformly recursive-separable classes
• Algebras over negative equivalences
• Negative dense linear orders
• Separable enumerations of division rings and effective embeddability of rings therein
• Structures of degrees of negative representations of linear orders
• Computably separable models
• Topological spaces over algorithmic representations of universal algebras
• Positive algebras with countable congruence lattices
• \(\Pi^0_1\)-presentations of algebras
• Recursively separable enumerated algebras
• CONSTRUCTIVE ALGEBRAS I

This page was built for publication: Computability and universal determinability of negatively representable models