Proof complexity, Vol. 170
Series: Encyclopedia of mathematics and its applicationsPublication details: Cambridge University Press, 2019. Cambridge:Description: xiv; 516 p. Hb. 24 cmISBN:- 9781108416849
- 511.36 KRA
Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
![]() |
IIT Gandhinagar | General | 511.36 KRA (Browse shelf(Opens below)) | 1 | Available | 029051 |
Browsing IIT Gandhinagar shelves, Collection: General Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.352 ARO Computational complexity: a modern approach | 511.352 ARO Computational complexity: a modern approach | 511.36 COO Logical foundations of proof complexity | 511.36 KRA Proof complexity, Vol. 170 | 511.36 LOL Meaning of proofs: mathematics as storytelling | 511.36 WOH Introduction to proof in abstract mathematics | 511.3609 STI Story of proof: logic and the history of mathematics |
Includes bibliographical references and index.
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
There are no comments on this title.