2009 | OriginalPaper | Chapter
A Characterisation of Definable NP Search Problems in Peano Arithmetic
Author : Arnold Beckmann
Published in: Logic, Language, Information and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.