## Substructural Type Theory

Noam Zeilberger

IMDEA Software Institute; Member, School of Mathematics

March 22, 2013

Noam Zeilberger

IMDEA Software Institute; Member, School of Mathematics

March 22, 2013

Andrej Bauer

University of Ljubljana, Slovenia; Member, School of Mathematics

March 21, 2013

Michael Shulman

University of California, San Diego; Member, School of Mathematics

March 20, 2013

Hao Huang

University of California, Los Angeles; Member, School of Mathematics

March 19, 2013

There are two important measures of the complexity of a boolean function: the sensitivity and block sensitivity. Whether or not they are polynomial related remains a major open question. In this talk I will survey some known results on this conjecture, and its connection with various combinatorial problems.

Eli Ben-Sasson

Technion; Massachusetts Institute of Technology

March 18, 2013

Egbert Rijke

School of Mathematics, IAS

March 14, 2013

Daniel Licata

Carnegie Mellon University; Member, School of Mathematics

March 13, 2013

Larry Guth

Massachusetts Institute of Technology

March 12, 2013

Hao Huang

University of California, Los Angeles; Member, School of Mathematics

March 12, 2013

Tim Roughgarden

Stanford University

March 11, 2013