Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Logical Foundations of Proof Complexity
  • Cited by 72
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      July 2010
      January 2010
      ISBN:
      9780511676277
      9780521517294
      9781107694118
      DOI:
      https://doi.org/10.1017/CBO9780511676277
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.94kg, 496 Pages
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.76kg, 496 Pages
      • Subjects:
      Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    Information

    Book description

    This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.

    Reviews

    'The book under review is a comprehensive introduction to bounded arithmetic … While the book is primarily aimed at students and researchers with background in theoretical computer science, its prerequisites in computational complexity are rather mild and are summarized in the Appendix, thus the book should be easily accessible to logicians and mathematicians coming from a different background. Some familiarity with logic will help the reader, but in this respect the book is more or less self-contained, the relevant bits of proof theory and model theory are developed in the first chapters in detail.'

    Source: Zentralblatt MATH

    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

    Contents

    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.