Proof Complexity Workshop 2026

16-17 June 2026, University of Bath

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.

Previous editions of the workshop: Proof Complexity 2024 , Proof Complexity 2025 

Registration:

To register for the workshop, please use the following Registration Form (Deadline 15 May).

Speakers:

• Noel Arteche (Lund University)

• Igor Carboni Oliveira (University of Warwick)

• Halley Goldberg (University of Warwick)

• Ondra Ježil (University of Warwick)

• Erfan Khaniki (University of Oxford)

• Jiaqi Lu (Imperial College London)

• Hunter Monroe (International Monetary Fund)

• Benedikt Pago (University of Cambridge)

• Rahul Santhanam (University of Oxford)

• Amir Tabatabai (University of Groningen)

• Navid Talebanfard (University of Sheffield)

• Neil Thapen (Czech Academy of Sciences)

Organizer: Raheleh Jalali