Extending work of Puninski, Puninskaya and Toffalori in [PPT07], we show that if V 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 [PPT07] for valuation domains with dense value group where it was proved for valuation domains with dense a...