Proof complexity is a vibrant area in the intersection of computational complexity, algorithms and mathematical logic exploring the inherent difficulty of proving mathematical theorems. This workshop aims to cover both traditional topics and emerging trends in the field such as lower bounds on lengths of proofs, bounded arithmetic, model theory & forcing, SAT & QBF solving, connections to TFNP and algebraic complexity, lifting theorems and meta-mathematics of complexity theory.

The workshop will take place on 3-5 September at the University of Oxford. The program will consist of talks by selected speakers and will include ample time for discussions. To register for the workshop, please use the following registration form.

Preliminary list of speakers:

• Noel Arteche

• Erfan Khaniki

• Moritz Müller

• Igor C. Oliveira

• Hanlin Ren

• Kilian Risse

• Robert Robere