Recursively separable enumerated algebras

DOI10.1070/RM1996v051n03ABEH002913zbMath0878.03034MaRDI QIDQ4341931

N. Kh. Kasymov

Publication date: 6 July 1997

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

zbMATH Keywords

surveyuniversal algebraenumeration theoryrecursive separabilityenumerated algebra

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Theory of numerations, effectively presented structures (03D45)

Related Items

Homomorphisms onto effectively separable algebras ⋮ Definability of linear orders over negative equivalences ⋮ Computably separable models ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ Computability and universal determinability of negatively representable models ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Topological spaces over algorithmic representations of universal algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Negative dense linear orders ⋮ Separable enumerations of division rings and effective embeddability of rings therein ⋮ \(T_1\)-separable numberings of subdirectly indecomposable algebras ⋮ Structures of degrees of negative representations of linear orders