"Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem",
to appear in Archive for Mathematical Logic, 2011
(pdf)
With Pavel Pudlák,
"Alternating minima and maxima, Nash equilibria and Bounded Arithmetic",
preprint, 2009
(pdf)
With Leszek Kolodziejczyk and Phuong Nguyen,
"The provably total NP search problems of weak second order
bounded arithmetic", preprint, 2009
(pdf)
With Alan Skelley,
"The provably total search problems of bounded arithmetic",
to appear in Proceeding of the London Mathematical Society, revised March 2010
(pdf)
With Leszek Kolodziejczyk,
"The polynomial and linear hierarchies in V0",
in Mathematical Logic Quarterly, Vol 55:5, pages 509–514, 2009
(an earlier version appeared in Proceedings of CiE 2007, LNCS 4497)
(pdf)
With Leszek Kolodziejczyk,
"The polynomial and linear hierarchies in models where the weak
pigeonhole principle fails",
in Journal of Symbolic Logic, Vol 73:2, pages 578-592,
2008
(pdf)
With Jan Krajicek and Alan Skelley,
"NP search problems in low fragments of bounded arithmetic" (revised 9/2006),
in Journal of Symbolic Logic, Vol 72:2, 2007
(postscript)
With Steve Cook, "The replacement scheme in weak arithmetic",
in ACM Transactions on Computational Logic, Vol 7:4, 2006
(postscript at TOCL)
"A note on Delta_1 induction and Sigma_1 collection",
in Fundamenta Mathematicae, Vol 186, 2005
(postscript)
With Nicola Galesi, "Resolution and pebbling games",
SAT 2005
(postscript)
With Michael Soltys, "Weak theories of linear algebra",
in Archive for Mathematical Logic, Vol 44:2, 2005
(postscript)
"Structures interpretable in models of bounded arithmetic",
in Annals of Pure and Applied Logic, Vol 135, 2005
(postscript)
"A model-theoretic characterization of the weak pigeonhole principle",
in Annals of Pure and Applied Logic, Vol 118, 2002
(postscript ,
dvi)
Miscellaneous
"Notes on switching lemmas", manuscript, 2009
(pdf)
"The weak pigeonhole principle in models of bounded arithmetic",
doctoral thesis, University of Oxford, 2002
(postscript,
dvi)