Mathematical Logic

The P versus NP problem is one of the Millenium Problems and according to Stephen Smale one of "the three greatest open problems of mathematics" and "a gift to mathematics from computer science". Its first formulation is due to Stephen Cook in 1967. Our research approaches this and related problems with means of mathematical logic. Special focus is given to Proof Complexity and Bounded Arithmetic.

10.24 Hauptvortrag  Colloquium Logicum, Vienna

09.24 Azza organizes JAF in Passau

07.24 Guest Yijia Chen (Shanghai)

06.24 Research visit Neil Thapen (Prague)

05.24 Guest Mykyta Narusevych (Prague)

05.24 Guest Ondreij Jezil (Prague) 

05.24 Guest Manuel Bodirsky (Dresden)

04.24 Seminar on Paradoxes Girls Day

04.24 Participation (online) MFO workshop

03.24 Talk  AlMoTh, Ilmenau

03.24 Research visit of Bonacina, Barcelona

02.24 Guest  Albert Atserias (Barcelona)

01.24 Guest  Anton Freund (Würzburg)

01.24 Guest Yijia Chen (Shanghai)

12.23 Guest Jan Pich (Oxford)
11.23 participation MFO workshop
10.23 Guest Eitetsu Ken (Tokyo)
09.23 Talk Online Complexity Seminar
09.23 Gaysin attends JAF
07.23 preprint with Joosten
06.23 Workshop on Algorithmic Law
06.23 Guest Joost Joosten (Barcelona)
05.23 Inaugural lecture
04.23 Seminar on paradoxes at Girls Day
03.23 Research visit of Bonacina, Barcelona
03.23 Online participation Simons workshop
02.03.23 Talk, AlMoTh, Bochum
02.23 paper with Atserias, Buss at STOC23
12.22 paper with Chen, Flum Bulletin EATCS
11.22 Talk, Prague Logic Seminar
11.22 Preprint with Chen, Yokoyama
06.22Plenary Talk Logic Colloquium 2022