Description: Proof Complexity, Hardcover by Krajicek, Jan, ISBN 1108416845, ISBN-13 9781108416849, Like New Used, Free shipping in the US "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 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: 165.8 USD
Location: Jessup, Maryland
End Time: 2024-12-31T00:30:50.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Proof Complexity
Number of Pages: 530 Pages
Language: English
Publication Name: Proof Complexity
Publisher: Cambridge University Press
Item Height: 1.3 in
Subject: Machine Theory, Logic
Publication Year: 2019
Type: Textbook
Item Weight: 32.2 Oz
Item Length: 9.5 in
Author: Jan KrajíčEk
Subject Area: Mathematics, Computers
Item Width: 6.3 in
Series: Encyclopedia of Mathematics and Its Applications Ser.
Format: Hardcover
