Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Proof Complexity
  • Cited by 33
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      March 2019
      March 2019
      ISBN:
      9781108242066
      9781108416849
      DOI:
      https://doi.org/10.1017/9781108242066
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.91kg, 530 Pages
      Dimensions:
      Weight & Pages:
      • Subjects:
      Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
      Series:
      Encyclopedia of Mathematics and its Applications (170)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    Series:
    Encyclopedia of Mathematics and its Applications (170)
    Information

    Book 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.

    Reviews

    ‘… the book has very rich content and its bibliographical material includes all previous books and survey articles related to proof complexity.’

    Anahit Artashes Chubaryan Source: MathSciNet

    'This book is in my view an excellent reference manual for a fundamental topic in mathematical logic and theoretical computer science.'

    Jaap van Oosten Source: Boekbesprekingen

    ‘… presents the field of proof complexity in its full breadth and depth.’

    Moritz Muller Source: Bulletin of Symbolic Logic

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Page 1 of 2

    Contents

    Page 1 of 2

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.