A Characterisation of Definable NP Search Problems in Peano Arithmetic

Authors:
Arnold Beckmann
Affiliations:
Department of Computer Science, Swansea University, Swansea, UK SA2 8PP
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 2
Cited 0

How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Explaining Gentzen's Consistency Proof within Infinitary Proof Theory

KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.