{"title":"Examining The Fragments of G","authors":"S. Perron","doi":"10.1109/LICS.2007.18","DOIUrl":null,"url":null,"abstract":"When restricted to proving Sigma<sub>i</sub> <sup>q</sup> formulas, the quantified prepositional proof system G<sub>i</sub>* is closely related to the Sigma<sub>i</sub> <sup>b</sup> theorems of Buss's theory S<sub>2</sub> <sup>i</sup>. Namely, G<sub>i</sub>* has polynomial- size proofs of the translations of theorems of S<sub>2</sub> <sup>i</sup>, and S<sub>2</sub> <sup>i</sup> proves that G<sub>i</sub>* is sound. However, little is known about G* when proving more complex formulas. In this paper, we prove a witnessing theorem for G<sub>i</sub>* similar in style to the KPT witnessing theorem for T<sub>2</sub> <sup>i</sup>. This witnessing theorem is then used to show that S<sub>2</sub> <sup>i</sup> proves G* is sound with respect to prenex Sigma<sub>i+1</sub> <sup>q</sup> formulas. Note that unless the polynomial hierarchy collapses S<sub>2</sub> <sup>i</sup> is the weakest theory in the S<sub>2</sub> <sup>i</sup> hierarchy for which this is true. The witnessing theorem is also used to show that G<sub>1</sub>* is p-equivalent to a quantified version of extended-Frege. This is followed by a proof that Gi p-simulates G*<sub>i+1</sub>. We finish by proving that S<sub>2</sub> can be axiomatized by S<sub>2</sub> <sup>1</sup> plus axioms stating that the cut-free version of G* is sound. All together this shows that the connection between G<sub>i</sub>* and S<sub>2</sub> <sup>i</sup> does not extend to more complex formulas.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"41 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2007.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
When restricted to proving Sigmaiq formulas, the quantified prepositional proof system Gi* is closely related to the Sigmaib theorems of Buss's theory S2i. Namely, Gi* has polynomial- size proofs of the translations of theorems of S2i, and S2i proves that Gi* is sound. However, little is known about G* when proving more complex formulas. In this paper, we prove a witnessing theorem for Gi* similar in style to the KPT witnessing theorem for T2i. This witnessing theorem is then used to show that S2i proves G* is sound with respect to prenex Sigmai+1q formulas. Note that unless the polynomial hierarchy collapses S2i is the weakest theory in the S2i hierarchy for which this is true. The witnessing theorem is also used to show that G1* is p-equivalent to a quantified version of extended-Frege. This is followed by a proof that Gi p-simulates G*i+1. We finish by proving that S2 can be axiomatized by S21 plus axioms stating that the cut-free version of G* is sound. All together this shows that the connection between Gi* and S2i does not extend to more complex formulas.