Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Bounded Arithmetic, Propositional Logic and Complexity Theory

$177.00

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: November 1995
  • availability: Available
  • format: Hardback
  • isbn: 9780521452052

$177.00
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. Then more advanced topics are treated, including polynomial simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, simple independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the approximation method and the method of Boolean valuations, combinatorics and complexity theory within bounded arithmetic, and relations to complexity issues of predicate calculus. Students and researchers in mathematical logic and complexity theory will find his comprehensive treatment an excellent guide to this expanding interdisciplinary area.

    • Comprehensive treatment of an expanding subject
    • Emphasis is given to independence proofs and lower bound proofs
    • Completely up-to-date survey
    Read more

    Reviews & endorsements

    "...the author has produced a very good piece of work, which can be strongly recommended to anyone wishing to study the relations between bounded arithmetic and complexity of propositional logic." Constantine Dimitracopoulos

    "...a mathematical masterpiece...presents students and researchers with the most important tools, general background and literature references to begin research in this exciting new area in the intersection of mathematical logic, theoretical computer science, and finite combinatorics...a major accomplishment...will play a substantial role in the training of future researchers." Journal of Symbolic Logic

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: November 1995
    • format: Hardback
    • isbn: 9780521452052
    • length: 360 pages
    • dimensions: 229 x 152 x 24 mm
    • weight: 0.7kg
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Preliminaries
    3. Basic complexity theory
    4. Basic propositional logic
    5. Basic bounded arithmetic
    6. Definability of computations
    7. Witnessing theorems
    8. Definability and witnessing in second order theories
    9. Translations of arithmetic formulas
    10. Finite axiomatizability problem
    11. Direct independence proofs
    12. Bounds for constant-depth Frege systems
    13. Bounds for Frege and extended Frege systems
    14. Hard tautologies and optimal proof systems
    15. Strength of bounded arithmetic
    References
    Index.

  • Author

    Jan Krajicek, Charles University, Prague

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×