DocumentCode
3112749
Title
Examining The Fragments of G
Author
Perron, Steven
Author_Institution
Univ. of Toronto, Toronto
fYear
2007
fDate
10-14 July 2007
Firstpage
225
Lastpage
234
Abstract
When restricted to proving Sigmai q formulas, the quantified prepositional proof system Gi* is closely related to the Sigmai b theorems of Buss´s theory S2 i. Namely, Gi* has polynomial- size proofs of the translations of theorems of S2 i, and S2 i 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 T2 i. This witnessing theorem is then used to show that S2 i proves G* is sound with respect to prenex Sigmai+1 q formulas. Note that unless the polynomial hierarchy collapses S2 i is the weakest theory in the S2 i 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 S2 1 plus axioms stating that the cut-free version of G* is sound. All together this shows that the connection between Gi* and S2 i does not extend to more complex formulas.
Keywords
theorem proving; Buss theory; complex formulas; extended-Frege; prepositional proof system; weakest theory; witnessing theorem; Arithmetic; Computational complexity; Computer science; Logic; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on
Conference_Location
Wroclaw
ISSN
1043-6871
Print_ISBN
0-7695-2908-9
Type
conf
DOI
10.1109/LICS.2007.18
Filename
4276567
Link To Document