Polynomial size proofs of the propositional pigeonhole principle

Journal of Symbolic Logic 52 (4):916-927 (1987)
Cook and Reckhow defined a propositional formulation of the pigeonhole principle. This paper shows that there are Frege proofs of this propositional pigeonhole principle of polynomial size. This together with a result of Haken gives another proof of Urquhart's theorem that Frege systems have an exponential speedup over resolution. We also discuss connections to provability in theories of bounded arithmetic
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273826
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,217
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

No references found.

Add more references

Citations of this work BETA
Pavel Hrubeš (2007). A Lower Bound for Intuitionistic Logic. Annals of Pure and Applied Logic 146 (1):72-90.
Lutz Straßburger (2012). Extension Without Cut. Annals of Pure and Applied Logic 163 (12):1995-2007.
Michael Soltys & Stephen Cook (2004). The Proof Complexity of Linear Algebra. Annals of Pure and Applied Logic 130 (1-3):277-323.

View all 11 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

5 ( #583,778 of 1,941,077 )

Recent downloads (6 months)

1 ( #458,098 of 1,941,077 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.