Decidability for theories of modules over valuation domains

Extending work of Puninski, Puninskaya andToffalori in [5],we showthat ifV is an effectively given valuation domain then the theory of all V-modules is decidable if and only if there exists an algorithm which, given a, b ∈ V, answers whether a ∈ rad(bV). This was conjectured in [5] for valuation domains with dense value group, where it was proved for valuation domains with dense archimedean value group. The only ingredient missing from [5] to extend the result to valuation domains with dense value group or infinite residue field is an algorithm which decides inclusion for finite unions of Ziegler open sets. We go on to give an example of a valuation domain with infinite Krull dimension, which has decidable theory of modules with respect to one effective presentation and undecidable theory of modules with respect to another. We show that for this to occur infinite Krull dimension is necessary.