![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 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](https://www.pdfsearch.io/img/e70376f3d5e2072e67b2715b57154524.jpg) Date: 2011-06-22 20:53:40Logic 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 ListSource URL: www.cs.toronto.eduDownload Document from Source Website File Size: 330,06 KBShare Document on Facebook
|