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 five books

Recent Publications

• E. Grädel, Ł. Kaiser, D. Berwanger, and R. Rabinovich. Entanglement and the Complexity Measures for Directed Graphs. Submitted for publication.
• E. Grädel and J. Väänänen. Dependence and Independence. Studia Logica. To appear.
• 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.). To Appear, 2012.
• E. Grädel and S. Siebertz. Dynamic Definability. In Proceedings of 15th International Conference on Database Theory, ICDT 2012. To Appear, 2012.
• V. Bárány, E. Grädel, and S. Rubin. Automata-Based Presentations of Infinite Structures. In Finite and Algorithmic Model Theory (J. Esparza, C. Michaux, and C. Steinhorn, Eds.), pp. 1–76, 2011.

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.