E. W. Beth Dissertation Prize

The Association for Logic, Language and Information (FoLLI) each year awards the E. W. Beth Dissertation Prize, named in honor of the Dutch mathematician Evert Willem Beth, to outstanding PhD theses in the fields of Logic, Language, and Information. Dissertations are evaluated on the basis of their technical depth, strength and originality. Each year the award can be assigned ex aequo to more than one thesis, or to no thesis at all. The prize consists of a certificate, a monetary award, and an invitation to submit (a possibly revised version of) the thesis to the FoLLI Publications on Logic, Language and Information,[1] published by Springer Science+Business Media.

List of previous winners [2]

YearAuthorTitle of the ThesisInstitution
2020Juan AguileraBetween the Finite and the InfiniteTechnische Universität Wien
Marcin WągielSubatomic QuantificationMasarykova Univerzita
2019 Bartosz Wcisło Understanding the strength of compositional truth Uniwersytet Warszawski
2018 İsmail İlkan Ceylan Query Answering in Probabilistic Data and Knowledge Bases Technical University of Dresden
2017Antoine AmarilliLeveraging the structure of uncertain dataTélécom ParisTech
Ronald de HaanParameterized Complexity in the Polynomial HierarchyTechnical University of Vienna
2016Thomas ZeumeSmall Dynamic Complexity ClassesUniversity of Dortmund
2015Michał SkrzypczakDescriptive set theoretic methods in automata theoryUniwersytet Warszawski
2014Thomas GrafLocal and Transderivational Constraints in Syntax and SemanticsUniversity of California, Los Angeles
2013Wesley H. HollidayKnowing What Follows: Epistemic Closure and Epistemic LogicStanford University
Ekaterina LebedevaExpressing Discourse Dynamics via ContinuationsUniversity of Lorraine
2012Andreas KapsnerLogics and FalsificationsUniversity of Barcelona
Daniel R. LicataDependently Typed Programming with Domain-Specific LogicsCarnegie Mellon University
2011Nils BullingModelling and Verifying Abilities of Rational AgentsClausthal University of Technology
Mohan GanesalingamThe Language of MathematicsUniversity of Cambridge
2010Yury SavateevAlgorithmic Complexity of Fragments of the Lambek CalculusMoscow State University
2009Emmanuel ChemlaPresuppositions and Scalar Implicatures: Formal and Experimental StudiesÉcole Normale Supérieure de Paris
Lukasz KaiserLogic and Games on Automatic StructuresRWTH Aachen
2008Tomas BrazdilVerification of Probabilistic Recursive Sequential ProgramsMasaryk University
Marco KuhlmannDependency Structures and Lexicalized GrammarsUniversität des Saarlandes
2007Gabriele PuppisAutomata for Branching and Layered StructuresUniversity of Udine
2006Leszek KołodziejczykTruth Definitions and higher-Order Logics in Finite ModelsUniwersytet Warszawski
Chung-chieh (Ken) ShanLinguistic Side EffectsHarvard University
2005Ash AsudehResumption as Resource ManagementUniversity of Canterbury
2004John T. HaleGrammar, Uncertainty and Sentence ProcessingMichigan State University
2003Jason BaldridgeLexically Specified Derivational Control in Combinatory Categorial GrammarUniversity of Edinburgh
2002Maria AloniQuantification under conceptual coversUniversity of Amsterdam
2001Gerald PennThe Algebraic Structure of Attributed Type SignaturesUniversity of Toronto
2000Jelle GerbrandyBisimulations on Planet KripkeUniversity of Amsterdam
Khalil Sima'anLearning Efficient DisambiguationUniversities of Amsterdam and Utrecht
1999Peter GrünwaldThe Minimum Description Length Principle and Reasoning under UncertaintyUniversity of Amsterdam
Matthew StoneModality in Dialogue: Planning, Pragmatics and ComputationUniversity of Pennsylvania
1998Nir FriedmanModeling Beliefs in Dynamic SystemsStanford University
Lisa MatthewsonDeterminer Systems and Quantificational Strategies: Evidence from SalishUniversity of British Columbia
gollark: Hmm, how *does* one find the prime factors?
gollark: It might be a salted hash, in which case it's essentially impossible öh bees.
gollark: So far, all tests are coming back negative still.
gollark: oh BEES combinatorial explosion.
gollark: Reverse the input? Will do.

See also

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.