Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T22:02:26.419Z Has data issue: false hasContentIssue false
  • English
  • Français

QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS

Published online by Cambridge University Press:  10 May 2016

JAMES AISENBERG ,
MARIA LUISA BONET  and
SAM BUSS
JAMES AISENBERG
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA SAN DIEGO, LA JOLLA CA 92093-0112, USAEmail:[email protected]
MARIA LUISA BONET
Affiliation:
LENGUAJES Y SISTEMAS INFORMÁTICOS UNIVERSIDAD POLITÉCNICA DE CATALUÑA BARCELONA, SPAINEmail: [email protected]
SAM BUSS
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA SAN DIEGO, LA JOLLA CA 92093-0112, USAEmail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parameter t, we prove that Frankl’s Theorem has polynomial size AC0-Frege proofs from instances of the pigeonhole principle.

Keywords

Frege proofsextended Frege proofsFrankl’s theoremtrace of setsKruskal–Katona theoremhereditary matrix
Type
Articles
Information
The Journal of Symbolic Logic , Volume 81 , Issue 2 , June 2016 , pp. 687 - 710
Copyright
Copyright © The Association for Symbolic Logic 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Beckmann, Arnold and Buss, Samuel R., Improved witnessing and local improvement principles for second-order bounded arithmetic . ACM Transactions on Computational Logic, vol. 15 (2014), article 2.CrossRefGoogle Scholar
Bonet, Maria Luisa, Buss, Samuel R., and Pitassi, Toniann, Are there hard examples for Frege systems? , Feasible Mathematics II (Clote, P. and Remmel, J., editors), Birkhäuser, Boston, 1995, pp. 30–56.Google Scholar
Buss, Samuel R., Polynomial size proofs of the propositional pigeonhole principle, this Journal, vol. 52 (1987), pp. 916–927.Google Scholar
Buss, Samuel R., Propositional consistency proofs . Annals of Pure and Applied Logic, vol. 52 (1991), pp. 3–29.Google Scholar
Cook, Stephen A. and Nguyen, Phuong, Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations, ASL and Cambridge University Press, Cambridge, 2010.Google Scholar
Cook, Stephen A. and Reckhow, Robert A., The relative efficiency of propositional proof systems, this Journal, vol. 44 (1979), pp. 36–50.Google Scholar
Frankl, Peter, On the trace of finite sets . Journal of Combinatorial Theory, Series A, vol. 34 (1983), pp. 41–45.CrossRefGoogle Scholar
Gessel, Ira and Rota, Gian-Carlo, editors, Classic Papers in Combinatorics, Birkhäuser, Boston, 1987.CrossRefGoogle Scholar
Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers, 6 edition, Oxford University Press, Oxford, 2008.CrossRefGoogle Scholar
Hrubeš, Pavel and Tzameret, Iddo, The proof complexity of polynomial identities, Proceedings of the 24th IEEE Conference on Computational Complexity (CCC) , 2009, pp. 41–51.Google Scholar
Istrate, Gabriel and Crãciun, Adrian, Proof complexity and the Kneser-Lovász theorem, Theory and Applications of Satisfiability Testing (SAT) , Lecture Notes in Computer Science, vol. 8561, Springer Verlag, 2014, pp. 138–153.Google Scholar
Katona, Gyula O. H., A theorem of finite sets , Theory of Graphs: Proc. Coll. Tihany, Hungary, Sept. 1966, Akadémiai Kiadó and Academic Press, 1966, pp. 187–207. Reprinted in [8], pp. 361–380.Google Scholar
Kołodziejczyk, Leszek Aleksander, Nguyen, Phuong, and Thapen, Neil, The provably total NP search problems of weak second-order bounded arithmetic . Annals of Pure and Applied Logic, vol. 162 (2011), pp. 419–446.CrossRefGoogle Scholar
Krajíček, Jan, Bounded Arithmetic, Propositional Calculus and Complexity Theory, Cambridge University Press, Heidelberg, 1995.Google Scholar
Kruskal, Joseph B., The number of simplices in a complex , Mathematical Optimization Techniques (Bellman, R., editor), University of California Press, Oakland, 1963, pp. 251–278.Google Scholar
Nozaki, Akihiro, Arai, Toshiyasi, and Arai, Noriko H., Polynomial-size Frege proofs of Bollobás’ theorem on the trace of sets . Proceedings of the Japan Academy, Series A, Mathematical Sciences, vol. 84 (2008), pp. 159–161.Google Scholar