2009 | OriginalPaper | Chapter
A Characterisation of Definable NP Search Problems in Peano Arithmetic

Author: Arnold Beckmann
Publisher: Springer Berlin Heidelberg
The complexity class of ≺
-bounded local search problems with goals
is introduced for well-orderings ≺, and is used to give a characterisation of definable
NP
search problems in Peano Arithmetic.