Arithmetic Interpretability Types of Varieties and Some Additive Problems with Primes

We deal with varieties with one basic operation f(x₁,...,x_n) and one defining identity f(x₁,..., x_n) = f(x_π(1),...,x_π(n)), where π is a permutation whose cyclic set consists of distinct primes p₁,...,p_r, with the sum p₁+...+p_r = n. Their interpretability types, together with the greatest element 1 in a lattice ^int, are said to be arithmetic. It is proved that the arithmetic types constitute a distributive lattice _ar, which is dual to a lattice Sub _fΠ of finite subsets of the set Π of all primes. It is shown that for n ⩾ 2, the poset _ar( _n) of arithmetic types defined by permutations in _n, for n fixed, is a lattice iff n = 2, 3, 4, 6, 8, 9, 11. __________ Translated from Algebra i Logika, Vol. 44, No. 5, pp. 622–630, September–October, 2005.