Forcing with Random Variables and Proof Complexity (Paperback)

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 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 non-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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	London Mathematical Society Lecture Note Series
Release date:	December 2010
First published:	2011
Authors:	Jan Krajicek
Dimensions:	228 x 152 x 15mm (L x W x T)
Format:	Paperback - Trade
Pages:	264
ISBN-13:	978-0-521-15433-8
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-521-15433-2
Barcode:	9780521154338

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!