Prof. Dr. Erich Grädel

Address
Mathematische Grundlagen der InformatikRWTH Aachen
D-52056 Aachen
| Phone: | +49-241-80-21730 |
| Fax: | +49-241-80-22215 |
| Room: | 4120 (E1) / Ahornstr. 55 |
| Email: | graedel [AT] logic.rwth-aachen.de |
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
- D. Fischer, E. Grädel, and Ł. Kaiser. Model Checking Games for the Quantitative $\mu$-Calculus. Theory of Computing Systems, 2009.
- A. Dawar and E. Grädel. The Descriptive Complexity of Parity Games. In Proceedings of the 17th Annual Conference on Computer Science Logic, CSL 2008, vol. 5213 of LNCS, pp. 354–368. Springer-Verlag, 2008.
- 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.
- E. Grädel. Banach-Mazur Games on Graphs. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008 (R. Hariharan, M. Mukund, and V. Vinay, Eds.), Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, Germany, 2008.
- 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. 4 of Texts in Logic and Games, pp. 151–178. Amsterdam University Press, 2008.
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.