All listings for this product
About this product
- DescriptionThis 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 about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a n-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory.
- Author BiographyJan Krajicek is a Professor of Mathematical Logic at Charles University in Prague. He is currently also affiliated with the Academy of Sciences of the Czech Republic.
- Author(s)Jan Krajicek
- PublisherCambridge University Press
- Date of Publication23/12/2010
- Series TitleLondon Mathematical Society Lecture Note Series
- Series Part/Volume Number382
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content NoteIllustrations
- Weight380 g
- Width152 mm
- Height228 mm
- Spine15 mm
- Format DetailsTrade paperback (US)
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $37.00Trending at AU $37.79
- AU $23.22Trending at AU $28.78
- AU $17.51Trending at AU $30.49
- AU $6.90Trending at AU $9.90
- AU $15.62Trending at AU $17.49
- AU $43.92Trending at AU $50.20
- AU $31.46Trending at AU $40.85
This item doesn't belong on this page.
Thanks, we'll look into this.