As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shonfinkel-Ramsey class is semi-decidable over von Neumann’s cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.