Safe Weak Minimization Revisited

Minimization operators of di#erent strength have been studied in the framework of "predicative (safe) recursion". In this paper a modification of these operators is presented. By adding the new operator to those used by Bellantoni-Cook and Leivant to characterize the polynomial-time computable functions one obtains a characterization of the nondeterministic polynomial-time computable multifunctions