{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7417","name":"Theories for Subexponential-size Bounded-depth Frege Proofs","abstract":"This paper is a contribution to our understanding of the relationship between uniform and nonuniform proof complexity. The latter studies the lengths of proofs in various propositional proof systems such as Frege and bounded-depth Frege systems, and the former studies the strength of the corresponding logical theories such as VNC1 and V0 in [Cook\/Nguyen, 2010]. A superpolynomial lower bound on the length of proofs in a propositional proof system for a family of tautologies expressing a result like the pigeonhole principle implies that the result is not provable in the theory associated with the propositional proof system.\r\nWe define a new class of bounded arithmetic theories n^epsilon-ioV^\\infinity for epsilon < 1 and show that they correspond to complexity classes AltTime(O(1),O(n^epsilon)), uniform classes of subexponential-size bounded-depth circuits DepthSize(O(1),2^O(n^epsilon)). To accomplish this we introduce the novel idea of using types to control the amount of composition in our bounded arithmetic theories. This allows our theories to capture complexity classes that have weaker closure properties and are not closed under composition. We show that the proofs of Sigma^B_0-theorems in our theories translate to subexponential-size bounded-depth Frege proofs.\r\nWe use these theories to formalize the complexity theory result that problems in uniform NC1 circuits can be computed by uniform subexponential bounded-depth circuits in [Allender\/Koucky, 2010]. We prove that our theories contain a variation of the theory VNC1 for the complexity class NC1. We formalize Buss's proof in [Buss, 1993] that the (unbalanced) Boolean Formula Evaluation problem is in NC1 and use it to prove the soundness of Frege systems. As a corollary, we obtain an alternative proof of [Filmus et al, ICALP, 2011] that polynomial-size Frege proofs can be simulated by subexponential-size bounded-depth Frege proofs.\r\nOur results can be extended to theories corresponding to other nice complexity classes inside NTimeSpace(n^O(1), n^o(1)) such as NL. This is achieved by essentially formalizing the containment\r\n\r\nNTimeSpace(n^O(1), n^o(1)) \\subseteq AltTime(O(1), O(n^epsilon))\r\n\r\nfor all epsilon > 0.","keywords":["Computational Complexity Theory","Proof Complexity","Bounded Arithmetic","NC1-Frege","AC0- Frege"],"author":[{"@type":"Person","name":"Ghasemloo, Kaveh","givenName":"Kaveh","familyName":"Ghasemloo"},{"@type":"Person","name":"Cook, Stephen A.","givenName":"Stephen A.","familyName":"Cook"}],"position":22,"pageStart":296,"pageEnd":315,"dateCreated":"2013-09-02","datePublished":"2013-09-02","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ghasemloo, Kaveh","givenName":"Kaveh","familyName":"Ghasemloo"},{"@type":"Person","name":"Cook, Stephen A.","givenName":"Stephen A.","familyName":"Cook"}],"copyrightYear":"2013","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.296","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6226","volumeNumber":23,"name":"Computer Science Logic 2013 (CSL 2013)","dateCreated":"2013-09-02","datePublished":"2013-09-02","editor":{"@type":"Person","name":"Ronchi Della Rocca, Simona","givenName":"Simona","familyName":"Ronchi Della Rocca"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7417","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6226"}}}