On automorphisms of computability potential scales for -element algebras.
On binary polynomials in idempotent commutative groupoids
On bisemilattices. I
On Boolean Extensions of Primal Algebras.
On clones determined by their initial segments
On closed classes of quasilinear functions
On compatible and order-preserving functions on lattices
On equations of clones
On finite functions with non-trivial arity gap
Given an n-ary k-valued function f, gap(f) denotes the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. We particularly solve a problem concerning the explicit determination of n-ary k-valued functions f with 2 ≤ gap(f) ≤ n ≤ k. Our methods yield new combinatorial results about the number of such functions.
On generating large classes of Sheffer functions.
On non-associative groupoids
On reduction theorems in the problem of composition of functions
On regular implicit operations
On semigroups of polynomial functions.
On sets related to maximal clones
For an arbitrary h-ary relation ρ we are interested to express n-clone Polⁿρ in terms of some subsets of the set of all n-ary operations Oⁿ(A) on a finite set A, which are in general not clones but we can obtain Polⁿρ from these sets by using intersection and union. Therefore we specify the concept a function preserves a relation and moreover, we study the properties of this new concept and the connection between these sets and Polⁿρ. Particularly we study for arbitrary partial order relations,...
On the arity of idempotent reducts of groups
On the characterization of primal partial algebras by strong regular hyperidentities.
On the conversion of binary algebras into semi-primal algebras
On the length of scales of computability potentials for -element algebras.
On the number of closed subsets of linear functions in the 6-valued logic