Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf,

First Page		Document Content
Date: 2011-06-22 20:53:40 Logic in computer science Automated theorem proving Frege system Propositional calculus Computational complexity theory Proof complexity Function Gottlob Frege Mathematical proof Mathematics Theoretical computer science Mathematical logic		Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf, Add to Reading List Source URL: www.cs.toronto.edu Download Document from Source Website File Size: 330,06 KB Share Document on Facebook

	A On the Power of Substitution in the Calculus of Structures Novak Novakovi´c, Inria Lutz Straßburger, Inria There are two contributions in this paper. First, we give a direct proof of the known fact that Frege system DocID: 1qGVY - View Document
	Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2 DocID: 1ggFx - View Document
	Proof complexity Boolean functions Craig’s interpolation Feasible interpolation Resolution Cutting planes The Frege System The interpolation technique in proof complexity Pavel Hrubeš University of Washington DocID: 1cllR - View Document
	Curriculum Vitae Samuel R. Buss Professor of Mathematics and Computer Science Department of Mathematics University of California, San Diego DocID: 18LzL - View Document
	Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf, DocID: 13xQC - View Document