Startseite

 

 

 

 

 

 

 

 

 

 
Print current pagePrint this page

Final results of the Kurt Gödel Research Prize Fellowship 2010

The Board of Jurors for Determining the Winners of the second round of the Kurt Gödel Research Prize Fellowships Program and the Kurt Gödel Society are proud to announce the winners of the 2010 competition.

Winners and their project proposals

Pre-doctoral category:

  • Danko Ilik: Towards a new Computational Interpretation of Sub-classical Principles
  • Sean Walsh: The Limits of Arithmetical Definability

Post-doctoral category:

  • Maryanthe Malliaris: Comparing the Complexity of Unstable Theories
  • Matteo Viale: Three Aspects of Goedel's Program:Supercompactness, Forcing Axioms and Omega Logic

Unrestricted category:

  • Ulrich Kohlenbach: New Frontiers in Proof Mining

The winners will present their winning projects at the conference marking the completion of the Fellowships competition to be held April 28-30, 2011 at the Austrian Academy of Sciences.

Finalists and their articles

The finalists were selected in first round and their articles will be published in the Annals of Pure and Applied Logic.

Pre-doctoral category:

  • Federico Aschieri: A Constructive Analysis of Learning in Peano Arithmetic
  • Kentaro Fujimoto: Classes and Truths in Set Theory
  • Danko Ilik: Delimited control operators prove Double-negation Shift
  • Sean Walsh: Comparing Peano Arithmetic, Basic Law V, and Hume’s Principle

Post-doctoral category:

  • Giovanni Curi: Topological inductive definitions
  • Misha Gavrilovich: A homotopy approach to set theory
  • Maryanthe Malliaris: Independence, order, and the interaction of ultrafilters and theories
  • Lynn Scow: Characterization of NIP theories by ordered graph-indiscernibles
  • Matteo Viale: Three aspects of Goedel's program: supercompactness, forcing axioms, Omega-logic
  • Christoph Weiss: The combinatorial essenence of supercompactness

Unrestricted category:

  • Ulrich Kohlenbach: Goedel functional interpretation and weak compactness
  • Andre Nies: Computably enumerable sets below random sets
  • Greg Restall: A Cut-Free Sequent System for Two-Dimensional Modal Logic, and why it matters
  • Alex Simpson: Measure, Randomness and Sublocales