Comparing decision problems for various paradigms of algebraic logic.
It is shown that in many cases the decision problems for varieties of cylindric algebras are much harder than those for the corresponding relation algebra reducts. The authors give examples of varieties of cylindric and relation algebras which are algorithmically more complicated then the subvarieties of their representable algebras.
scientific article; zbMATH DE number 2158787