TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Research Meeting 26219

Book Project: Introductory Textbook on Proof Complexity

( May 18 – May 22, 2026 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/26219

Organizers
  • Nicola Galesi (Sapienza University of Rome, IT)
  • Jacobo Torán (Universität Ulm, DE)

Contact

Description

Proof Complexity is an active area of research located between Complexity Theory and Logic and with connections with many other areas in Computer Science. It has been the subject of several Dagstuhl meetings in the past. The project – an introductory textbook on Proof Complexity – is already in an advanced stage and many aspects have to be revised and discussed.

Copyright Nicola Galesi and Jacobo Torán