Address

Mathematische Grundlagen der Informatik
RWTH 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

Computer Science Department's Teaching Award for the course "Mathematical Logic" 2019

Teaching

• Winter Term 2022
• Seminar Logic, Complexity, Games: Propositional Proof Complexity
• Summer Term 2022
• Mathematical Logic
• Winter Term 2021
• Seminar Logic, Complexity, Games: Algorithmic Meta-Theorems and Parameterized Complexity
• Winter Term 2020
• Mathematical Logic II
• Winter Term 2019
• Seminar Logic, Complexity, Games: Logics for Reasoning about Uncertainty, Dependence and Independence
• Summer Term 2019
• Mathematical Logic
• Winter Term 2018
• Seminar Logic, Complexity, Games: 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

Recent Publications

• 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.
• B. Pago. Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) (J. Leroux, S. Lombardy, and D. Peleg, Eds.), vol. 272 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 73:1–73:15, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
• B. Pago. Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023) (B. Klin and E. Pimentel, Eds.), vol. 252 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 31:1–31:19, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
• 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], full version of CSL'23 paper, 2022.

All publications