Forcing with Random Variables and Proof Complexity
(Book #382 in the London Mathematical Society Lecture Note Series)
No Customer Reviews
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 are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking...
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"
Customer Reviews
0 rating
Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
