Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- Introduction
- PART I BASICS
- PART II SECOND-ORDER STRUCTURES
- PART III AC0 WORLD
- 6 Theories IΔ0, IΔ0(R) and V01
- 7 Shallow Boolean decision tree model
- 8 Open comprehension and open induction
- 9 Comprehension and induction via quantifier elimination: a general reduction
- 10 Skolem functions, switching lemma and the tree model
- 11 Quantifier elimination in K(Ftree, Gtree)
- 12 Witnessing, independence and definability in V01
- PART IV AC0(2) WORLD
- PART V TOWARDS PROOF COMPLEXITY
- PART VI PROOF COMPLEXITY OF Fd AND Fd (⊕)
- PART VII POLYNOMIAL-TIME AND HIGHER WORLDS
- PART VIII PROOF COMPLEXITY OF EF AND BEYOND
- Appendix: Non-standard models and the ultrapower construction
- Standard notation, conventions and list of symbols
- References
- Name index
- Subject index
6 - Theories IΔ0, IΔ0(R) and V01
Published online by Cambridge University Press: 05 November 2011
Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- Introduction
- PART I BASICS
- PART II SECOND-ORDER STRUCTURES
- PART III AC0 WORLD
- 6 Theories IΔ0, IΔ0(R) and V01
- 7 Shallow Boolean decision tree model
- 8 Open comprehension and open induction
- 9 Comprehension and induction via quantifier elimination: a general reduction
- 10 Skolem functions, switching lemma and the tree model
- 11 Quantifier elimination in K(Ftree, Gtree)
- 12 Witnessing, independence and definability in V01
- PART IV AC0(2) WORLD
- PART V TOWARDS PROOF COMPLEXITY
- PART VI PROOF COMPLEXITY OF Fd AND Fd (⊕)
- PART VII POLYNOMIAL-TIME AND HIGHER WORLDS
- PART VIII PROOF COMPLEXITY OF EF AND BEYOND
- Appendix: Non-standard models and the ultrapower construction
- Standard notation, conventions and list of symbols
- References
- Name index
- Subject 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
- Forcing with Random Variables and Proof Complexity , pp. 49 - 51Publisher: Cambridge University PressPrint publication year: 2010