Characterizing Definable Search Problems in Bounded Arithmetic via Proof Notations. Preliminary manuscript (2004)

by A Beckmann, S Buss
Venue:Non-Automatizability of Bounded-Depth Frege Proofs, Computational Complexity