- English
- PDF
- Available on iOS & Android
Forcing with Random Variables and Proof Complexity
About This Book
This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory.
Frequently asked questions
Information
Table of contents
- Cover
- Title
- Copyright
- Dedication
- Contents
- Preface
- Acknowledgment
- Introduction
- Part I Basics
- Part II Second-order structures
- Part III AC0 world
- 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
- Standard notation, conventions and list of symbols
- References
- Subject Index
- Name Index