nested PLS

In this note we will introduce a class of search problems, called nested Polynomial Local Search (nPLS) problems, and show that definable NP search problems, i.e., ${\mathrm{\Sigma }}_1^b$-definable functions in $T_2^2$ are characterized in terms of the nested PLS.