A model-theoretic characterization of the weak pigeonhole principle

Annals of Pure and Applied Logic 118 (1-2):175-195 (2002)
We bring together some facts about the weak pigeonhole principle 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 separation result in bounded arithmetic, that PV + lies strictly between PV and S21 in strength, assuming that the cryptosystem RSA is secure
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/S0168-0072(02)00038-6
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 36,003
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Notes on Polynomially Bounded Arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Relating the Bounded Arithmetic and Polynomial Time Hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.
$Aleph_0$-Categoricity Over a Predicate.Anand Pillay - 1983 - Notre Dame Journal of Formal Logic 24 (4):527-536.
Classification Theory Over a Predicate. I.Anand Pillay & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (4):361-376.

View all 6 references / Add more references

Citations of this work BETA

Structures Interpretable in Models of Bounded Arithmetic.Neil Thapen - 2005 - Annals of Pure and Applied Logic 136 (3):247-266.
Upper and Lower Ramsey Bounds in Bounded Arithmetic.Kerry Ojakian - 2005 - Annals of Pure and Applied Logic 135 (1-3):135-150.

Add more citations

Similar books and articles

The Weak Pigeonhole Principle for Function Classes in S12.Norman Danner & Chris Pollett - 2006 - Mathematical Logic Quarterly 52 (6):575-584.
Pigeonhole and Choice Principles.Wolfgang Degen - 2000 - Mathematical Logic Quarterly 46 (3):313-334.
Isols and the Pigeonhole Principle.J. C. E. Dekker & E. Ellentuck - 1989 - Journal of Symbolic Logic 54 (3):833-846.
Dual Weak Pigeonhole Principle, Boolean Complexity, and Derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.
On the Indecomposability of $\Omega^{N}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.


Added to PP index

Total downloads
2 ( #950,141 of 2,293,920 )

Recent downloads (6 months)
1 ( #412,142 of 2,293,920 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature