Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Allen B.: Arithmetizing uniform NC. Ann. Pure Appl. Logic 53(1), 1–50 (1991)
2. Beckmann A., Buss S.R.: Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. J. Math. Logic 9(1), 103–138 (2009)
3. Beckmann, A., Buss, S.R.: Characterising definable search problems in bounded arithmetic via proof notations. In: Schindler, R. (ed.) Ways of Proof Theory, Ontos Series on Mathematical Logic, pp. 65–134 (2010)
4. Boughattas, S., Kołodziejczyk, L.A.: The strength of sharply bounded induction requires MSP (2009) (to appear Annals of Pure and Applied Logic)
5. Boughattas, S., Ressayre, J.P.: Bootstrapping I (2009) (to appear Annals of Pure and Applied Logic)