Benedikt Pago

Address
Mathematische Grundlagen der InformatikRWTH Aachen
D-52056 Aachen
Phone: | +49-241-80-21726 |
Fax: | +49-241-80-22215 |
Room: | 4114a (E1) / Ahornstr. 55 |
Email: | pago [AT] logic.rwth-aachen.de |
Office Hours
Whenever the door is open.Research
- Descriptive Complexity Theory
- Proof Complexity
- Choiceless Polynomial Time
Awards
Teaching
- Winter Term 2022
- Summer Term 2022
- Winter Term 2021
- Winter Term 2020
- Winter Term 2019
- Summer Term 2019
- Winter Term 2018
Selected talks
- Slides for the talk "A Finite-Model-Theoretic View on Propositional Proof Complexity", held at the Simons online workshop on Theoretical Foundations of SAT/SMT Solving, Berkeley 2021
- Slides for the talk "Limitations of Choiceless Definability", held at CSL 2021, Ljubljana
Recent Publications
- B. Pago. Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. arXiv:2206.05086 [cs.LO], to appear at CSL'23, 2022.
- B. Pago. Choiceless Computation and Symmetry: Limitations of Definability. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) (C. Baier and J. Goubault-Larrecq, Eds.), vol. 183 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 33:1–33:21, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2021.
- E. Grädel, M. Grohe, B. Pago, and W. Pakusa. A Finite-Model-Theoretic View on Propositional Proof Complexity. Logical Methods in Computer Science, vol. Volume 15, Issue 1, 2019.
- E. Grädel, B. Pago, and W. Pakusa. The Model-Theoretic Expressiveness of Propositional Proof Systems. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017.