Lower Bounds to the size of constant-depth propositional proofs

Journal of Symbolic Logic 59 (1):73-86 (1994)
LK is a natural modification of Gentzen sequent calculus for propositional logic with connectives ¬ and $\bigwedge, \bigvee$ (both of bounded arity). Then for every d ≥ 0 and n ≥ 2, there is a set Td n of depth d sequents of total size O(n3 + d) which are refutable in LK by depth d + 1 proof of size exp(O(log2 n)) but such that every depth d refutation must have the size at least exp(nΩ(1)). The sets Td n express a weaker form of the pigeonhole principle
Keywords Lengths of proofs   propositional calculus   Frege systems   pigeonhole principle
Categories (categorize this paper)
DOI 10.2307/2275250
 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: 15,904
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
Samuel R. Buss (2012). Towards–Via Proof Complexity and Search. Annals of Pure and Applied Logic 163 (7):906-917.
Emil Jeřábek (2012). Proofs with Monotone Cuts. Mathematical Logic Quarterly 58 (3):177-187.

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

74 ( #42,188 of 1,725,422 )

Recent downloads (6 months)

70 ( #14,565 of 1,725,422 )

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.