Description: 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.
Price: 188 AUD
Location: Hillsdale, NSW
End Time: 2024-12-07T21:24:50.000Z
Shipping Cost: 26.06 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 60 Days
Return policy details:
EAN: 9781108416849
UPC: 9781108416849
ISBN: 9781108416849
MPN: N/A
Book Title: Proof Complexity (Encyclopedia of Mathematics and
Item Length: 24.1 cm
Number of Pages: 530 Pages
Publication Name: Proof Complexity
Language: English
Publisher: Cambridge University Press
Item Height: 241 mm
Subject: Computer Science, Mathematics
Publication Year: 2019
Type: Textbook
Item Weight: 910 g
Author: Jan Krajicek
Item Width: 161 mm
Format: Hardcover
