Proof Complexity (Hardcover)

Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Encyclopedia of Mathematics and its Applications
Release date:	March 2019
Authors:	Jan Krajicek
Dimensions:	241 x 161 x 33mm (L x W x T)
Format:	Hardcover
Pages:	530
ISBN-13:	978-1-108-41684-9
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN:	1-108-41684-5
Barcode:	9781108416849

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!