Wow! eBook
Bounded Arithmetic, Propositional Logic and Complexity Theory
Author(s): Jan Krajicek (Author)
- Publisher: Cambridge University Press
- Publication Date: November 24, 1995
- Edition: 1st
- Language: English
- Print length: 360 pages
- ISBN-10: 0521452058
- ISBN-13: 9780521452052
Book Description
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.
Editorial Reviews
Review
“…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
Book Description
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.
