Overview

This book presents an up-to-date, unified treatment of research in in this interdisciplinary subject with emphasis on independence proofs and lower bound proofs. A basic introduction is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. Then more advanced topics are treated, including Boolean complexity, witnessing theorems, and bounded arithmetic as a system of feasible arguments. Students and researchers in logic and computer science will find this an excellent guide to an expanding area.

Full Product Details

9781306148450

Table of Contents

Reviews

. ..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

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available