Former Address

Mathematische Grundlagen der Informatik
RWTH Aachen
D-52056 Aachen

Fax:	+49-241-80-22215
Email:	pakusa [AT] logic.rwth-aachen.de

Office Hours

By appointment

Research

• Logic for Polynomial Time
• Extensions of Fixed Point Logics
• Infinite Games
• Algorithmic Model Theory
• Descriptive Complexity Theory

Dissertation

Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time (Download (PDF))

Lehre

• Seminar Logik, Komplexität, Spiele
  • Logics of Dependence and Independence
  • Fixed-Point Logics
  • Computational Social Choice
  • Definierbarkeit und Komplexität
  • Axiome und Modelle der Mengenlehre
  • Endliche Modelltheorie
  • Automatische Strukturen
• Vorlesung Algorithmische Modelltheorie (SS16)
• Übungen zur Vorlesung Algorithmische Modelltheorie (WS13, WS11)
• Übungen zur Vorlesung Mathematische Logik (SS15, SS14, SS13, SS12, SS10, SS09, SS08)
• Übungen zur Vorlesung Logik und Spiele ( WS15, SS13, SS11)

Selected talks

• Slides for the talk at GAMES, Paris 2011
• Slides for the talk at AlMoTh, Ilmenau 2012
• Slides for the talk at MFCS, Budapest 2014
• Slides for the talk at AlMoTh, Siegen 2016

Recent Publications

• A. Dawar, E. Grädel, and W. Pakusa. Approximations of Isomorphism and Logics with Linear-Algebraic Operators. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (C. Baier, I. Chatzigiannakis, P. Flocchini, and S. Leonardi, Eds.), vol. 132 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 112:1–112:14, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2019.
• A. Dawar, E. Grädel, and W. Pakusa. Approximations of Isomorphism and Logics with Linear-Algebraic Operators. arXiv:1902.06648 [cs.LO], 2019.
• 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 and W. Pakusa. Rank logic is dead, long live rank logic! The Journal of Symbolic Logic, vol. 84(1), 2019.
• F. Abu Zaid, A. Dawar, E. Grädel, and W. Pakusa. Definability of Summation Problems for Abelian Groups and Semigroups. In Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
• M. Grohe and W. Pakusa. Descriptive Complexity of Linear Equation Systems and Applications to Propositional Proof Complexity. In Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
• 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.

All publications