The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Forcing with random variables and complexity of computations and proofs

Krajicek, J (Czech Academy of Sciences)
Thursday 20 April 2006, 11:00-12:00

Seminar Room 1, Newton Institute


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.

Back to top ∧