Forcing with Random Variables and Proof Complexity

by Jan Krajíček

This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 0521154332
• ISBN13: 9780521154338
• Release Date: February 2011
• Publisher: Cambridge University Press
• Length: 264 Pages
• Weight: 0.85 lbs.
• Dimensions: 0.6" x 5.9" x 8.9"