Prof. Dr. Erich Grädel

Address

Research

• GAMES - ESF Research Networking Programme
• Algorithmic Model Theory
• Fixed-Point Logics
• Logic and Algorithms

Activities

• Programme Chair of the ESF Research Networking Programme GAMES
• Editor of the Journal of Symbolic Logic
• Editor of the Reviews Section in Bulletin of Symbolic Logic
• Editor of Logical Methods in Computer Science
• Co-author/-editor of four books

Recent Publications

• E. Grädel and M. Ummels. Solution Concepts and Algorithms for Infinite Multiplayer Games. In New Perspectives on Games and Interaction (K. Apt and R. van Rooij, Eds.), vol. 5 of Texts in Logic and Games. Amsterdam University Press. To appear.
• D. Fischer, E. Grädel, and Ł. Kaiser. Model Checking Games for the Quantitative $\mu$-Calculus. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008 (S. Albers and P. Weil, Eds.), pp. 301–312, 2008.
• D. Berwanger, E. Grädel, and G. Lenzi. The variable hierarchy of the $\mu$-calculus is strict. Theory of Computing Systems, vol. 40, pp. 437–466, 2007.
• J. Flum, E. Grädel, and T. Wilke (Eds.). Logic and Automata: History and Perspectives. Amsterdam University Press, 2007.
• E. Grädel. Finite Model Theory and Descriptive Complexity. In Finite Model Theory and Its Applications, pp. 125–230. Springer-Verlag, 2007.

All publications

Selected Talks

• Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions.
  Invited Talk at IEEE Symposium on Logic in Computer Science (LICS 03), Ottawa, June 2003.
• Finite presentations of infinite structures: automata and interpretations.
  Invited talk at Workshop on Complexity in Automated Deductions, Federated Logic Conference FLoC 2002, Kopenhagen, July 2002.
• Decidable fragments of first-order and fixed-point logic.
  Invited talk at Kalmár Workshop on Logic and Complexity, Szeged, October 2003 (commemorating the work of László Kalmár).
• Once upon a time in the west. Determinacy, definability, and complexity of pathgames.