My research focusses on proof theory, the area of mathematical logic concerned with formal proofs. In particular I am interested in the interactions between logic and computational complexity. During my PhD I studied proof complexity in the deep inference methodology, where inference steps may operate within arbitrary contexts. Since then I have become interested in approaches to complexity via weak theories of arithmetic and substructural logics. Aside from this, I also work on various aspects of rewriting theory and the proof theory of logics over relational structures.
I teach regularly in the classroom and laboratory for both mathematics and computer science.
Outside academia I used to be an amateur distance runner. My UK Athletics profile can be found here.