Charles Explorer logo
🇬🇧

Forcing with random variables and Proof Complexity

Publication at Faculty of Mathematics and Physics |
2011

Abstract

We develop a new method for constructing models of bounded arithmetic and apply it to proof complexity.