If the constant field is computable, i.e., for elements not dependent on "x", the problem of zero-equivalence is decidable, then the Risch algorithm is a complete algorithm.
Therefore, the Risch algorithm too requires that the constant field be computable, i.e., that for elements not dependent on "x", the problem of zero-equivalence is decidable.