Proof Complexity
eBook - PDF

Proof Complexity

  1. 534 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Proof Complexity

About this book

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.

Table of contents

  1. Cover
  2. Half-Title
  3. Series information
  4. Title Page
  5. Copyright information
  6. Dedication
  7. Contents
  8. Preface
  9. Acknowledgements
  10. Introduction
  11. Part I Basic Concepts
  12. Part II Upper Bounds
  13. Part III Lower Bounds
  14. Part IV Beyond Bounds
  15. Bibliography
  16. Special Symbols
  17. Index

Trusted by 375,005 students

Access to over 1.5 million titles for a fair monthly price.

Study more efficiently using our study tools.

Information

Publisher
Cambridge University Press
Year
2019
Topic
Mathematics
Print ISBN
9781108416849
Subtopic
Logic in Mathematics
eBook ISBN
9781108271585
Index
Mathematics

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn how to download books offline
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1.5 million books across 990+ topics, we’ve got you covered! Learn about our mission
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more about Read Aloud
Yes! You can use the Perlego app on both iOS and Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app
Yes, you can access Proof Complexity by Jan Krajíček in PDF and/or ePUB format, as well as other popular books in Mathematics & Logic in Mathematics. We have over 1.5 million books available in our catalogue for you to explore.