Abstract
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., $${\Sigma^{b}_{1}}$$ -definable functions in $${T^{2}_{2}}$$ are characterized in terms of the nested PLS.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Archiv für Mathematische Logik und Grundlagenforschung
Paper Title
Journal
Date
