The Scientific Program can be downloaded here.
The Social Program can be downloaded here.
List of talks:
- Eli Ben Sasson: "On affine extractors and bipartite Ramsey graphs" (abstract)
- Olaf Beyersdorff: "Proof Systems that Take Advice" (abstract) (slides)
- Michiel De Smet: "Unprovability in Ramsey Theory" (abstract)
- Bill Gasarch:
- Philipp Gerhardy:
- Lev Gordeev: "Combinatorial conditions for P < NP and NP = coNP" (abstract) (slides)
- Emil Jerabek: "Weak pigeonhole principle and approximate counting" (abstract)
- Gyula Karolyi: "Ramsey theory in combinatorial convexity" (abstract)
- Alexander Kreuzer: "Ramsey's Theorem for pairs and provable recursive functions" (abstract) (slides)
- Oliver Kullmann: "Ramsey theory and SAT" (abstract) (slides)
- Hanno Lefmann: "Graphs and Partition Regular Systems of Equations" (abstract)
- Alberto Marcone: "The reverse mathematics of the Veblen function" (abstract) (slides)
- Antonio Montalban: "The boundary of Determinacy in Second Order Arithmetic" (abstract)
- Matteo Novaga: "Infinite paths and cliques in random graphs" (abstract)
- Pavel Pudlak: "Ramsey theorem in computational complexity" (abstract)
- Neil Thapen:
- Jan-Christoph Schlage-Puchta: "Zero-sum problems in finite abelian groups" (abstract)
- Oleg Verbistky:
- Andreas Weiermann: "Phase transitions in Ramsey theory" (abstract)
- Tin Lok Wong: "End-extending models of arithmetic using Ramsey-type principles" (abstract) (slides)