Bounded Arithmetic, Propositional Logic and Complexity Theory
Ranked #26 in Arithmetic
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... more
Similar Books
If you like Bounded Arithmetic, Propositional Logic and Complexity Theory, check out these similar top-rated books:
