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: | 2226 (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 five books
Recent Publications
- E. Grädel. Model-Checking Games for Logics of Incomplete Information. Theoretical Computer Science, Special Issue dedicated to GandALF 2011. To appear
- E. Grädel and J. Väänänen. Dependence and Independence. Studia Logica, vol. 101(2), pp. 399-410, 2013.
- F. Abu Zaid, E. Grädel, and Ł. Kaiser. The Field of Reals is not omega-Automatic. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012 (C. Dürr and T. Wilke, Eds.), 2012.
- D. Berwanger, E. Grädel, Ł. Kaiser, and R. Rabinovich. Entanglement and the Complexity of Directed Graphs. Theoretical Computer Science, vol. 463(0), pp. 2–25, 2012.
- A. Dawar, E. Grädel, B. Holm, E. Kopczynski, and W. Pakusa. Definability of linear equation systems over groups and rings. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (P. Cégielski and A. Durand, Eds.), vol. 16 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 213–227, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2012.
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.