Computably separable models

DOI10.1007/s10958-022-06033-1OpenAlexW4289131115MaRDI QIDQ2168971

N. Kh. Kasymov, F. N. Ibragimov

Publication date: 29 August 2022

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-022-06033-1

Mathematics Subject Classification ID

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

Related Items (1)

Computability and universal determinability of negatively representable models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 Noetherian congruence lattices
• 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
• Über rekursive Strukturen
• Positive algebras with countable congruence lattices
• \(\Pi^0_1\)-presentations of algebras
• On computable automorphisms of the rational numbers
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Rekursive Algebren mit Kettenbedingungen
• Recursively separable enumerated algebras
• CONSTRUCTIVE ALGEBRAS I
• Hierarchies of Boolean algebras

This page was built for publication: Computably separable models