๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Matrix identities and the pigeonhole principle

โœ Scribed by Michael Soltys; Alasdair Urquhart


Publisher
Springer
Year
2004
Tongue
English
Weight
83 KB
Volume
43
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Pigeonhole and Choice Principles
โœ Wolfgang Degen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 300 KB
A New Proof of the Weak Pigeonhole Princ
โœ Alexis Maciel; Toniann Pitassi; Alan R. Woods ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

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.

The weak pigeonhole principle for functi
โœ Norman Danner; Chris Pollett ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 199 KB ๐Ÿ‘ 1 views

## Abstract It is well known that __S__ ^1^~2~ cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in __S__ ^1^~2~ for provably weaker function class

A model-theoretic characterization of th
โœ Neil Thapen ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

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