This paper is concerned with
the solution of certain decision problems for classes of associative commutative rings.
We consider several such classes defined by restricting the nature of the rings, e.g., by
specifying the characteristic. If 𝒦 is any of these classes we consider the problem of
deciding which universal sentences are true in (all members of) 𝒦. We show that this
problem is recursively solvable.