This article is cited in 20 papers

Homomorphisms onto effectively separable algebras

N. Kh. Kasymov

Mirzo Ulugbek Uzbekistan National University, Tashkent, Uzbekistan

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.

Keywords: negative and positive equivalences, separable and effectively separable enumerations of algebras, Artinian congruence lattice, separability axioms.

UDC: 510.55+512.57

Received: 06.10.2014

DOI: 10.17377/smzh.2016.57.105

 English version: Siberian Mathematical Journal, 2016, 57:1, 36–50

Bibliographic databases:

• 
• 
• 
•