Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties (Q1119619)

The main result of the paper is the following: The first order theory of the class of all finite algebras in a finitely generated arithmetical variety of finite type in which all subdirectly irreducible algebras have linearly ordered congruences, is decidable. The proof is based on a representation of finite algebras from such varieties by some quotients of special subdirect products in which sets of indices are partially ordered in dual trees.