Bounded Arithmetic, Propositional Logic and Complexity Theory
Jan Krajicek, B. Doran (Editor), G. -C RotaBooks.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Synopsis
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.
Booknews
Synthesizes recent research in bounded arithmetic and the complexity of propositional logic, emphasizing independence proofs and lower bound proofs. Also discusses the deep connections between logic and complexity theory and lists several intriguing problems waiting for answers. Introduces the basics of logic and complexity theory, then reports results in propositional proof systems and systems of bounded arithmetic. More advanced topics include polynomial simulations and conservativity results, and various witnessing theorems. Addressed to research mathematicians and computer scientists with no previous knowledge of the subject. Annotation c. Book News, Inc., Portland, OR (booknews.com)