Adresse

Mathematische Grundlagen der Informatik
RWTH Aachen
D-52056 Aachen

Telefon:	+49-241-80-21726
Fax:	+49-241-80-22215
Büro:	4114a (E1) / Ahornstr. 55
E-Mail:	pago [AT] logic.rwth-aachen.de

Sprechstunden

Wenn die Tür offen ist.

Forschung

• Descriptive Complexity Theory
• Proof Complexity
• Choiceless Polynomial Time

Preise und Auszeichnungen

Lehrpreis der Fachgruppe Informatik für die Veranstaltung "Mathematische Logik" 2019

Lehre

• Wintersemester 2022
• Seminar Logik, Komplexität, Spiele: Beweiskomplexität
• Sommersemester 2022
• Mathematische Logik
• Wintersemester 2021
• Seminar Logik, Komplexität, Spiele: Algorithmische Meta-Theoreme und parametrisierte Komplexität
• Wintersemester 2020
• Mathematische Logik II
• Wintersemester 2019
• Seminar Logik, Komplexität, Spiele: Logics for Reasoning about Uncertainty, Dependence and Independence
• Sommersemester 2019
• Mathematische Logik
• Wintersemester 2018
• Seminar Logik, Komplexität, Spiele: Computational Social Choice

Selected talks

• Slides for the talk "Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits", held at Highlights of Logic, Games and Automata, Kassel 2023
• Slides for an invited talk at the Logic Mentoring Workshop, Warsaw 2023
• Slides for the talk "Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus", held at CSL 2023, Warsaw 2023
• 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

Aktuelle Publikationen

• A. Dawar, E. Grädel, L. Kullmann, and B. Pago. Symmetric Proofs in the Ideal Proof System. arXiv:2504.16820 [cs.LO], 2025.
• M. Lichter, B. Pago, and T. Seppelt. Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024) (A. Murano and A. Silva, Eds.), vol. 288 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 36:1–36:19, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
• M. Lichter, B. Pago, and T. Seppelt. Limitations of Game Comonads via Homomorphism Indistinguishability. arXiv:2308.05693 [cs.LO], full version of CSL'24 paper, 2023.
• B. Pago. Limitations of Choiceless Computation. PhD thesis, RWTH Aachen University, 2023.
• B. Pago. Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits. arXiv:2302.05426 [cs.CC], full version of MFCS'23 paper, 2023.

Alle Publikationen