Bounded Arithmetic, Propositional Logic and Complexity Theory

(Book #60 in the Encyclopedia of Mathematics and its Applications Series)

by Jan Krajíček

No Customer Reviews

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

Format:Hardcover

Language:English

ISBN:0521452058

ISBN13:9780521452052

Release Date:November 1995

Publisher:Cambridge University Press

Length:360 Pages

Weight:1.44 lbs.

Dimensions:1.1" x 6.4" x 9.5"

Related Subjects

Math Mathematics Science Science & Math Science & Scientists Science & Technology

Customer Reviews

0 rating

Write a review

ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.

Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks^® and the ThriftBooks^® logo are registered trademarks of Thrift Books Global, LLC

Bounded Arithmetic, Propositional Logic and Complexity Theory

(Book #60 in the Encyclopedia of Mathematics and its Applications Series)

Recommended

Customer Reviews

Popular Categories

Website

My Account

Partnerships

Quick Help

About Us

Follow Us