As proved recently, the satisfiability problem for all prenex formulae in the set-theoretic Bernays-Schönfinkel-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.
