Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 1 Introduction
- 2 Preliminaries
- 3 Basic complexity theory
- 4 Basic propositional logic
- 5 Basic bounded arithmetic
- 6 Definability of computations
- 7 Witnessing theorems
- 8 Definability and witnessing in second order theories
- 9 Translations of arithmetic formulas
- 10 Finite axiomatizability problem
- 11 Direct independence proofs
- 12 Bounds for constant-depth Frege systems
- 13 Bounds for Frege and extended Frege systems
- 14 Hard tautologies and optimal proof systems
- 15 Strength of bounded arithmetic
- References
- Subject index
- Name index
- Symbol index
12 - Bounds for constant-depth Frege systems
Published online by Cambridge University Press: 02 December 2009
Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 1 Introduction
- 2 Preliminaries
- 3 Basic complexity theory
- 4 Basic propositional logic
- 5 Basic bounded arithmetic
- 6 Definability of computations
- 7 Witnessing theorems
- 8 Definability and witnessing in second order theories
- 9 Translations of arithmetic formulas
- 10 Finite axiomatizability problem
- 11 Direct independence proofs
- 12 Bounds for constant-depth Frege systems
- 13 Bounds for Frege and extended Frege systems
- 14 Hard tautologies and optimal proof systems
- 15 Strength of bounded arithmetic
- References
- Subject index
- Name index
- Symbol index
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Bounded Arithmetic, Propositional Logic and Complexity Theory , pp. 232 - 278Publisher: Cambridge University PressPrint publication year: 1995