Millions of books in English, Spanish and other languages. Free UK delivery 

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications)
Type
Physical Book
Year
1995
Language
English
Pages
360
Format
Hardcover
Dimensions
24.2 x 16.2 x 2.7 cm
Weight
0.65 kg.
ISBN
0521452058
ISBN13
9780521452052
Edition No.
1

Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications)

Jan Krajicek (Author) · Cambridge University Press · Hardcover

Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications) - Krajicek, Jan

New Book

£ 117.11

  • Condition: New
Origin: Spain (Import costs included in the price)
It will be shipped from our warehouse between Thursday, July 04 and Thursday, July 11.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.

Synopsis "Bounded Arithmetic, Propositional Logic and Complexity Theory Hardback (Encyclopedia of Mathematics and its Applications)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews