The rigid relation principle, a new weak choice principle
โ Scribed by Hamkins, Joel David; Palumbo, Justin
- Book ID
- 118764085
- Publisher
- John Wiley and Sons
- Year
- 2012
- Tongue
- English
- Weight
- 93 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, J. B. Paris et al. (J. Symbolic Logic 53 (1988), 1235-1244) showed how to prove the weak pigeonhole principle with bounded-depth, quasipolynomialsize proofs.
We bring together some facts about the weak pigeonhole principle (WPHP) from bounded arithmetic, complexity theory, cryptography and abstract model theory. We characterize the models of arithmetic in which WPHP fails as those which are determined by an initial segment and prove a conditional separat