Bounded Arithmetic, Propositional Logic and Complexity Theory

by Jan Krajíček

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"