BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Bounded Arithmetic, Propositional Logic and Complexity Theory

Bounded Arithmetic, Propositional Logic and Complexity Theory

Bounded Arithmetic, Propositional Logic and Complexity Theory
Stock photo: cover may vary

Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback -

by Jan Krajicek

Add to wish list
  • New
  • Hardback
New

Description

Cambridge University Press CUP , pp. 360 . Hardback. New.
Ask the seller a question Add to wish list
A$426.73
A$5.81 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Bounded Arithmetic, Propositional Logic and Complexity Theory
  • Author Jan Krajicek
  • Binding Hardback
  • Edition First Edition
  • Condition New
  • Pages 360
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press CUP , New York
  • Publication date pp. 360
  • Bookseller's Inventory # 6426719
  • ISBN 9780521452052 / 0521452058
  • Weight 1.44 lbs (0.65 kg)
  • Dimensions 9.52 x 6.38 x 1.07 in (24.18 x 16.21 x 2.72 cm)
  • Category Science
  • Library of Congress subjects Computational complexity, Proposition (Logic)
  • Library of Congress Catalogue Number 94047054
  • Dewey Decimal Code 511.3
  • Quantity available 4

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for Bounded Arithmetic, Propositional Logic and Complexity Theory

From the publisher

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