A Characterisation of Definable NP Search Problems in Peano Arithmetic

First Author: Beckmann A
Attributed to:  Abstract Measures of Low-Level Computational Complexity funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-02261-6_1

Publication URI: http://dx.doi.org/10.1007/978-3-642-02261-6_1

Type: Book Chapter

Book Title: Logic, Language, Information and Computation (2009)

Page Reference: 1-12

ISBN: 978-3-642-02260-9

ISSN: 0960-3174