A Characterisation of Definable NP Search Problems in Peano Arithmetic

Arnold Beckmann. A Characterisation of Definable NP Search Problems in Peano Arithmetic. In Hiroakira Ono, Makoto Kanazawa, Ruy J. G. B. de Queiroz, editors, Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings. Volume 5514 of Lecture Notes in Computer Science, pages 1-12, Springer, 2009. [doi]

Abstract

Abstract is missing.