1. Aehlig, K., Beckmann, A.: On the computational complexity of cut-reduction. Submitted to APAL (2008)
2. Beckmann, A., Buss, S.R.: Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. Technical Report CSR15-2008, Department of Computer Science, Swansea University (December 2008)
3. Beckmann, A., Buss, S.R.: Characterising definable search problems in bounded arithmetic via proof notations. Technical report, Department of Computer Science, Swansea University (January 2009)
4. Beckmann, A., Buss, S.R., Pollett, C.: Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Logic 120(1-3), 197–223 (2003)
5. Buss, S.R., Krajíček, J.: An application of Boolean complexity to separation problems in bounded arithmetic. Proc. London Math. Soc. (3) 69(1), 1–21 (1994)