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 questions related to the algorithmic complexity of enumerations of the algebras satisfying various separability axioms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.