📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations

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.1515/9783110324907.65

Publication URI: http://dx.doi.org/10.1515/9783110324907.65

Type: Book Chapter

Book Title: Ways of Proof Theory - (2010)

Page Reference: 65-134