Beth Award

FoLLI awards each year the E. W. Beth Dissertation Prize, named in honor of the Dutch mathematician Evert Willem Beth. This prize rewards outstanding contributions in the domains of Logic, Language and Information.

The 2016 E.W. Beth Dissertation Prize has been awarded to:

Thomas Zeume, Small Dynamic Complexity Classes, Technical University of Dortmund

The short-listed candidates: this year were

  • Karel Chvalovsky (Charles University in Prague): Undecidability of Some Substructural Logics
  • Amelie David (Université Paris-Saclay): Towards Synthesizing Open Systems: Tableaux for Multi-Agent Temporal Logics
  • Patrick Koopmann (University of Manchester): Practical Uniform Interpolation for Expressive Description Logics
  • Yaron Velner (Tel Aviv University): Multidimensional and Pushdown Mean-Payoff Games with Applications to Quantitative Verification and Synthesis of Programs: Complexity, Decidability and Algorithms

The recipients of the prize have been:

  • 2016 Thomas Zeume, Small Dynamic Complexity Classes, University of Dortmund
  • 2015 Michał Skrzypczak, Descriptive set theoretic methods in automata theory, University of Warsaw
  • 2014 Thomas Graf, Local and Transderivational Constraints in Syntax and Semantics, University of California, Los Angeles
  • 2013
    • Wesley H. Holliday, Knowing What Follows: Epistemic Closure and Epistemic Logic, Stanford University
    • Ekaterina Lebedeva, Expressing Discourse Dynamics via Continuations, University of Lorraine
  • 2012
    • Andreas Kapsner, Logics and Falsifications, University of Barcelona
    • Daniel R. Licata, Dependently Typed Programming with Domain-Specific Logics, Carnegie Mellon University
  • 2011
    • Nils Bulling, Modelling and Verifying Abilities of Rational Agents, TU Clausthal
    • Mohan Ganesalingam, The Language of Mathematics, University of Cambridge
  • 2010 Yury Savateev, Algorithmic Complexity of Fragments of the Lambek Calculus, Moscow State University
  • 2009
    • Emmanuel Chemla, Presuppositions and Scalar Implicatures: Formal and Experimental Studies, Ecole Normale Superieure de Paris
    • Lukasz Kaiser, Logic and Games on Automatic Structures, Aachen University
  • 2008
    • Tomas Brazdil, Verification of Probabilistic Recursive Sequential Programs, Masaryk University
    • Marco Kuhlmann, Dependency Structures and Lexicalized Grammars, Saarland University
  • 2007 Gabriele Puppis, Automata for Branching and Layered Structures, University of Udine
  • 2006
    • Leszek Kolodziejczyk, Truth Definitions and higher-Order Logics in Finite Models, Warsaw University
    • Chung-chieh (Ken) Shan, Linguistic Side Effects, Harvard University
  • 2005 Ash Asudeh, Resumption as Resource Management, Stanford University
  • 2004 John T. Hale, Grammar, Uncertainty and Sentence Processing, Michigan State University
  • 2003 Jason Baldridge, Lexically Specified Derivational Control in Combinatory Categorial Grammar, University of Edinburgh
  • 2002 Maria Aloni, Quantification under conceptual covers, University of Amsterdam
  • 2001 Gerald Penn, The Algebraic Structure of Attributed Type Signatures, University of Toronto
  • 2000
    • Jelle Gerbrandy, Bisimulations on Planet Kripke, University of Amsterdam
    • Khalil Sima’an, Learning Efficient Disambiguation, Universities of Amsterdam and of Utrecht
  • 1999
    • Peter Grünwald, The Minimum Description Length Principle and Reasoning under Uncertainty, University of Amsterdam
    • Matthew Stone, Modality in Dialogue: Planning, Pragmatics and Computation, University of Pennsylvania
  • 1998
    • Nir Friedman, Modeling Beliefs in Dynamic Systems, Stanford University
    • Lisa Matthewson, Determiner Systems and Quantificational Strategies: Evidence from Salish, University of British Columbia