Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgements
- Introduction
- Part I Basic Concepts
- Part II Upper Bounds
- 8 Basic Example of the Correspondence between Theories and Proof Systems
- 9 The Two Worlds of Bounded Arithmetic
- 10 Up to EF via the 〈. . .〉 Translation
- 11 Examples of Upper Bounds and p-Simulations
- 12 Beyond EF via the || . . . || Translation
- Part III Lower Bounds
- Part IV Beyond Bounds
- Bibliography
- Special Symbols
- Index
10 - Up to EF via the 〈. . .〉 Translation
from Part II - Upper Bounds
Published online by Cambridge University Press: 25 March 2019
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgements
- Introduction
- Part I Basic Concepts
- Part II Upper Bounds
- 8 Basic Example of the Correspondence between Theories and Proof Systems
- 9 The Two Worlds of Bounded Arithmetic
- 10 Up to EF via the 〈. . .〉 Translation
- 11 Examples of Upper Bounds and p-Simulations
- 12 Beyond EF via the || . . . || Translation
- Part III Lower Bounds
- Part IV Beyond Bounds
- Bibliography
- Special Symbols
- Index
Summary
Keywords
- Type
- Chapter
- Information
- Proof Complexity , pp. 197 - 210Publisher: Cambridge University PressPrint publication year: 2019