Homomorphisms onto effectively separable algebras
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.
- ^0_1-presentations of algebras
- Algebras over negative equivalences
- CONSTRUCTIVE ALGEBRAS I
- Definability of linear orders over negative equivalences
- scientific article; zbMATH DE number 1404550 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3254884 (Why is no real title available?)
- scientific article; zbMATH DE number 3091018 (Why is no real title available?)
- Recursively separable enumerated algebras
- Positive equivalences with finite classes and related algebras
- Homomorphisms onto negative algebras
- 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
- \(T_1\)-separable numberings of subdirectly indecomposable algebras
- Structures of degrees of negative representations of linear orders
- Computably separable models
- Topological spaces over algorithmic representations of universal algebras
- Uniform \(m\)-equivalencies and numberings of classical systems
- Computability and universal determinability of negatively representable models
- Homomorphisms of separoids
- Recursively separable enumerated algebras
- Lower semilattices of separable congruences of numbered algebras
- Separable algorithmic representations of classical systems and their applications
- Logical specifications of effectively separable data models
- Computably separable numbering of locally finitely separable algebras
- Finite logical specifications of effectively separable data models
- Unoids with finiteness conditions over computably separable equivalences
This page was built for publication: Homomorphisms onto effectively separable algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299155)
