skip to content
 

Forcing with random variables and complexity of computations and proofs

Date: 
Thursday 20th April 2006 - 11:00 to 12:00
Venue: 
INI Seminar Room 1
Abstract: 

We develop a new construction of models of arithmetic. The models are Boolean-valued and are based on random variables. We outline some applications to bounded arithmetic and to complexity theory.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons