- Foundations of mathematics, especially meta-mathematics of arithmetic (first and second order) and weak set theories
- Higher-order aspects of proof-theoretic concepts
- Computational content of proofs, program extraction
- Length of proofs, slow consistency
- Methods: Mainly ordinal analysis, but also set-theoretic constructions and non-standard models of arithmetic
Papers and Notes:
- A Higher Bachmann-Howard Principle. Preprint available via arXiv:1704.01662.
- Slow Reflection, submitted. Preprint available via arXiv:1601.08214.
- Proof Lengths for Instances of the Paris-Harrington Principle, Ann. Pure Appl. Logic 168 (2017) 1361-1382. Available via doi:10.1016/j.apal.2017.01.004 (published version) or arXiv:1601.08185 (accepted manuscript).
- A Uniform Characterization of Γ1-Reflection over the Fragments of Peano Arithmetic. Unpublished note, available via arXiv:1512.05122.
- Characteristic Spaces of del Pezzo Surfaces. Master's Thesis at LMU Munich (2014). Supervised by Ulrich Derenthal, and available via his website.
- Type-Two Well-Ordering Principles and Π11-Comprehension, invited to the special session on proof theory, Logic Colloquium 2017, Stockholm University (forthcoming).
- The slow reflection hierarchy, Logic Colloquium 2016, University of Leeds. Abstract to appear in Bull. Symbolic Logic.
- A computational look at slow provability, Workshop Mathematics for Computation, Niederalteich 2016.
- Where can we really prove instances of the Paris-Harrington Principle?, Joint DMV and GAMM Annual Meeting 2016, TU Braunschweig. Extended abstract in Proc. Appl. Math. Mech. 16 (2016) 903-904. Available via doi:10.1002/pamm.201610440.
Disclaimer: This is not an official university website.