Separable algorithmic representations of classical systems and their applications

DOI10.1007/s10958-024-06934-3OpenAlexW4391144351MaRDI QIDQ6192015

R. N. Dadazhanov, F. N. Ibragimov, N. Kh. Kasymov

Publication date: 12 February 2024

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

Full work available at URL: https://doi.org/10.1007/s10958-024-06934-3

zbMATH Keywords

classical algebraic systemMaltsev theoremseparable algorithmic representation

Mathematics Subject Classification ID

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

Cites Work

• Homomorphisms onto effectively separable algebras
• Definability of linear orders over negative equivalences
• Positive algebras with Noetherian congruence lattices
• Positive equivalences with finite classes and related algebras
• Homomorphisms onto negative algebras
• The number of \(Q\)-congruences in positive 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
• Separable enumerations of division rings and effective embeddability of rings therein
• \(T_1\)-separable numberings of subdirectly indecomposable algebras
• Nonconstructive negative algebras with finiteness conditions
• 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 enumerable sets and degrees
• Recursively separable enumerated algebras
• Effective compacts over co-immune sets
• Hierarchies of Boolean algebras
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Separable algorithmic representations of classical systems and their applications