Homomorphisms onto effectively separable algebras (Q299155): Difference between revisions

The author studies a series of variations of the concept of separability for equivalences on natural numbers, enumerations, and algebras defined on such equivalences. Here are two examples of separability properties: 1) an equivalence \(\eta\) on \(\omega\) is called separable if every pair of its distinct cosets is separated by a recursively enumerable set which is the union of equivalence classes of \(\eta\); 2) an equivalence is called effectively separable if there exists a computable numbering of separating sets. When speaking about separability of enumerations, we mean the properties of their enumeration equivalences, namely, an enumeration \(\nu\) is said to have some separability property if its enumeration equivalence \(\{\langle x,y\rangle\mid\nu(x)=\nu(y)\}\) does have this property. From the author's abstract: ``We study variations of the concept of separable enumeration and, basing on that, describe a series of algorithmic and algebraic concepts. In this framework we characterize negative equivalences, describe enumerated algebras with the most general separability conditions, give a separability criterion for the enumerated algebras satisfying the descending chain condition for the lattices of congruences, and consider some question related to the algorithmic complexity of enumerations of the algebras satisfying various separability axioms.''