Prof. Dr. Erich Grädel

Address

Research

• Algorithmic Model Theory
• Logic and Game Theory
• Logic and Algorithms
• Fixed-Point Logics
• Logics for Dependence and Independence

Activities

• Editor of Logical Methods in Computer Science (since 2004)
• Editor of Mathematical Logic Quarterly (since 2012)
• Member of the Editorial Board of the Journal of Logic and Computation (Corner Editor for Logic and Games, since 2007).
• Editor of the Journal of Symbolic Logic (2008 - 2013
• Chair of the European GAMES Research-Training Network (2002 – 2013)
• Author/Editor of five books

Recent Publications

• E. Grädel, M. Grohe, B. Pago, and W. Pakusa. A Finite-Model-Theoretic View on Propositional Proof Complexity. arXiv:1802.09377 [cs.LO], 2018.
• E. Grädel and M. Hoelzel. Dependency Concepts up to Equivalence. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018) (D. Ghica and A. Jung, Eds.), vol. 119 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 25:1–25:21, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.
• 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.
• F. Abu Zaid, E. Grädel, and F. Reinhardt. Advice Automatic Structures and Uniformly Automatic Classes. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 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

Selected Talks

• Is Polyonomial Time Choiceless
  
• Dependence and Independence in Logic.
  Tutorial at Logic Colloquium 2015.
• Finite presentations of infinite structures: automata and interpretations.
  
• Decidable fragments of first-order and fixed-point logic.
  
• Banach-Mazur Games on Graphs