Advertisement

The Ackermann Award 2005

  • Erich Grädel
  • Janos Makowsky
  • Alexander Razborov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3634)

Abstract

At the annual conference of the EACSL, CSL’04, it was suggested to the newly elected president of EACSL that steps be taken to make the Annual Conference of EACSL even more attractive for young researchers in Logic and Computer Science. In response to this suggestion, the EACSL Board decided in November 2004 to launch the

Ackermann Award, the EACSL Outstanding Dissertation Award for Logic in Computer Science.

Keywords

Proof System Tree Automaton Tree Language Automate Theorem Prove Automate Deduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Erich Grädel
    • 1
  • Janos Makowsky
    • 1
  • Alexander Razborov
    • 1
  1. 1.Members of EACSL Jury for the Ackermann Award 

Personalised recommendations