Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations
Stephen Cook and Phuong Nguyen

(c) copyright 2004, 2005, 2006

The current draft has approximately 300 pages, and was posted April 3, 2006.

PLEASE SEND COMMENTS AND CORRECTIONS TO THE AUTHORS

Chapters 8 and 9, and the appendix have not been completed.
Chapter 10 is not yet written.

NEW (March, 2007): Revised Chapter 9 Theories for Small Classes

Preface and Table of Contents (.ps) Contains motivating examples

Book (including index) (.ps)

Book (including index) (.pdf)

Chapter Summary

Preface (preliminary version)
Chapter 1 Propositional Calculus
Chapter 2 Predicate Calculus
Chapter 3 Peano Arithmetic and its Subsystems
Chapter 4 Two-Sorted First-Order Logic
Chapter 5 The Theory V0 and AC0
Chapter 6 The Theory V1 and Polynomial Time
Chapter 7 Propositional Translations
Chapter 8 Theories for Polynomial Time and Beyond (partly completed)
Chapter 9 Theories for Small Classes (partly completed)
Chapter 10 Proof Systems for Small Theories (not written)
Apendix A Computation Models (partly completed)
Bibliography
Index