Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Invited Plenary Talk:
Forcing with random variables and proof complexity

Speaker: Jan Krajíček

Abstract

We discuss applications of forcing to proof complexity. 


websites: Arnold Beckmann 2006-04-20 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net