Starting with the most basic notions, Universal Algebra: Fundamentals and Selected Topics
introduces all the key elements needed to read and understand current research in this field …

The study of polynomial completeness of algebraic systems has only recently matured, and
until now, lacked a unified treatment. Polynomial Completeness in Algebraic Systems …

We characterize in a relatively simple algebraic fashion the functors establishing categorical
equivalence between two equational classes of algebras. Our results will actually be proved …

The notion of program-computable function on a universal algebra is formalized through the
notion of conditional term. This leads to a somewhat new approach to the study of traditional …

We study varieties generated by semi-primal lattice-expansions by means of category
theory. We provide a new proof of the Keimel-Werner topological duality for such varieties …

В монографии рассматриваются вопросы классификации классических и
универсальных алгебр в тех или иных естественных языках математической логики. С …

The notion of program-computable function on a universal algebra is formalized through the
notion of conditional term. This leads to a somewhat new approach to the study of traditional …

Sets. We give a characterization of finite irreducible resets. We show that every finite reset
has a representation by minimal resets which are certain distinguished irreducible retracts. It …

Let A be a finite algebra with a majority term. We characterize those algebras categorically
equivalent to A. The description is in terms of a derived structure with universe consisting of …

Дается алгебраическое описание класса конечных моделей вычислений, реализуемых
в современных компьютерах, и правил сборки из них крупномасштабных …