Prof. Dr. Erich Grädel

Adresse

Forschung

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

Tätigkeiten

• Programme Chair des ESF Research Networking Programme GAMES
• Herausgeber des Journal of Symbolic Logic
• Herausgeber der Reviews Section des Bulletin of Symbolic Logic
• Herausgeber des Journals Logical Methods in Computer Science
• Autor und Herausgeber von vier Büchern

Aktuelle Publikationen

• V. Bárány, E. Grädel, and S. Rubin. Automata-Based Presentations of Infinite Structures. Submitted for publication.
• A. Dawar and E. Grädel. Properties of Almost All Graphs and Generalized Quantifiers. Fundamenta Informaticae. To appear
• D. Fischer, E. Grädel, and Ł. Kaiser. Model Checking Games for the Quantitative $\mu$-Calculus. Theory of Computing Systems, 2009.
• E. Grädel and R. Kahle (Eds.). Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic, CSL '09. Springer, 2009.
• E. Grädel, Ł. Kaiser, and R. Rabinovich. Directed Graphs of Entanglement Two. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT '09, vol. 5699 of LNCS, pp. 169–181. Springer, 2009.

Alle Publikationen

Ausgewählte Vorträge

• 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.