Lower Bounds to the size of constant-depth propositional proofs

Journal of Symbolic Logic 59 (1):73-86 (1994)
Abstract
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)
Options
 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: 12,088
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.

Citations of this work BETA
Emil Jeřábek (2012). Proofs with Monotone Cuts. Mathematical Logic Quarterly 58 (3):177-187.
Samuel R. Buss (2012). Towards–Via Proof Complexity and Search. Annals of Pure and Applied Logic 163 (7):906-917.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

4 ( #267,800 of 1,101,944 )

Recent downloads (6 months)

4 ( #91,857 of 1,101,944 )

How can I increase my downloads?

My notes
Sign in to use this feature


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