[Proof Complexity] FLoC workshop on proof complexity - Call for Participation

[Olaf Beyersdorff]

FLoC workshop on proof complexity - Call for Participation
----------------------------------------------------------

Lisbon, 18/19 July 2026
https://proofcomplexityworkshop.gitpages.uni-jena.de

The workshop will be part of FLoC (https://www.floc26.org) and affiliated with the conference SAT'26 (https://satisfiability.org/SAT26/).

=== Scope ===

Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P?  Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT solving.

=== Invited Speakers ===

Noah Fleming (University of Lund)
Jan Pich (University of Oxford)
Benjamin Böhm (University of Jena): invited speaker in the joint session with the QBF workshop
Dmitry Sokolov (University of Montreal)


=== Organizers ===

Olaf Beyersdorff (University of Jena)
Massimo Lauria (Sapienza Rome)
Jan Johannsen (LMU Munich) 

—
Professor Olaf Beyersdorff
Institute of Computer Science
University of Jena
Inselplatz 5, 07743 Jena, Germany
Phone: +49 (0)3641 946321
Email: olaf.beyersdorff at uni-jena.de
https://www.ti1.uni-jena.de