[Proof Complexity] Proof Theory Virtual Seminar

Anupam Das anupamdotdas at gmail.com
Fri Sep 25 15:31:54 CEST 2020

Dear colleagues,

We are pleased to announce the Proof Theory Virtual Seminar, an online
seminar series that presents talks by leading researchers from all areas
of proof theory. It will be inaugurated with the following talks:

7 October, 17:00 UTC: Sam Buss
Title: Propositional proof systems and bounded arithmetic for logspace and
nondeterministic logspace

21 October, 09:00 UTC: Michael Rathjen
Title: Far beyond Goodman's Theorem?

4 November, 17:00 UTC: Valeria de Paiva
Title: Benchmarking Theorems of Implicational Intuitionistic Linear Logic

18 November, 09:00 UTC: Albert Visser
Title: Fixed Points meet Löb's Rule

2 December, 17:00 UTC: Ulrich Kohlenbach

16 December, 09:00 UTC: Matthias Baaz

To attend, it suffices to click on a Zoom link, which you can find on our


If you would like to receive reminders, you can sign up to our email list
by joining the following google group (no google account required):


For further information (including abstracts for the talks listed above),
please visit the aforementioned website. We look forward to seeing you at
the seminar!

Best wishes,
Lev Beklemishev, Yong Cheng, Anupam Das, Anton Freund, Thomas Powell, Sam
Sanders, Monika Seisenberger, Andrei Sipos, Henry Towsner

More information about the Proof-Complexity mailing list