Journal of Symbolic Logic

Polynomial Size Proofs of the Propositional Pigeonhole Principle

Samuel R. Buss

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 52, Issue 4 (1987), 916-927.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183742501

Mathematical Reviews number (MathSciNet)
MR916397

Zentralblatt MATH identifier
0636.03053

JSTOR
links.jstor.org

Citation

Buss, Samuel R. Polynomial Size Proofs of the Propositional Pigeonhole Principle. J. Symbolic Logic 52 (1987), no. 4, 916--927. https://projecteuclid.org/euclid.jsl/1183742501


Export citation