Abstract
The Pigeonhole Principle forn is the statement that there is no one-to-one function between a set of sizen and a set of sizen−1. This statement can be formulated as an unlimited fan-in constant depth polynomial size Boolean formulaPHP n inn(n−1) variables. We may think that the truth-value of the variablex i,j will be true iff the function maps thei-th element of the first set to thej-th element of the second (see Cook and Rechkow [5]).PHP n can be proved in the propositional calculus. That is, a sequence of Boolean formulae can be given so that each one is either an axiom of the propositional calculus or a consequence of some of the previous ones according to an inference rule of the propositional calculus, and the last one isPHP n . Our main result is that the Pigeonhole Principle cannot be proved this way, if the size of the proof (the total number or symbols of the formulae in the sequence) is polynomial inn and each formula is constant depth (unlimited fan-in), polynomial size and contains only the variables ofPHP n .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
