1![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 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](https://www.pdfsearch.io/img/13905f2d7d6be597e0ce1e8b1ed81806.jpg) | Add to Reading ListSource URL: www.lix.polytechnique.frLanguage: English - Date: 2015-04-07 12:31:04
|
---|
2![Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2 Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2](https://www.pdfsearch.io/img/59a2c8d29a9468a6b7c68e7e334329e4.jpg) | Add to Reading ListSource URL: www.ensiie.frLanguage: English - Date: 2015-01-06 05:30:45
|
---|
3![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 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](https://www.pdfsearch.io/img/cd3d4f127d6678238f8445366cfd8000.jpg) | Add to Reading ListSource URL: cav2013.forsyte.atLanguage: English - Date: 2013-07-24 08:46:26
|
---|
4![Curriculum Vitae Samuel R. Buss Professor of Mathematics and Computer Science Department of Mathematics University of California, San Diego Curriculum Vitae Samuel R. Buss Professor of Mathematics and Computer Science Department of Mathematics University of California, San Diego](https://www.pdfsearch.io/img/269fe7416cf5fac4d9e2adf12d6b7b73.jpg) | Add to Reading ListSource URL: euclid.ucsd.eduLanguage: English - Date: 2013-03-11 00:53:25
|
---|
5![Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf, Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf,](https://www.pdfsearch.io/img/e70376f3d5e2072e67b2715b57154524.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2011-06-22 20:53:40
|
---|
6![Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria](https://www.pdfsearch.io/img/ea45151552c1b100540bbbabd0b2894a.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2013-05-06 19:14:13
|
---|
7![A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh](https://www.pdfsearch.io/img/cc0ee864418c6a8a04a9dbc5b21dd822.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2014-04-05 15:13:04
|
---|
8![CHAPTER I An Introduction to Proof Theory Samuel R. Buss Departments of Mathematics and Computer Science, University of California, San Diego La Jolla, California[removed], USA CHAPTER I An Introduction to Proof Theory Samuel R. Buss Departments of Mathematics and Computer Science, University of California, San Diego La Jolla, California[removed], USA](https://www.pdfsearch.io/img/9ce9bfed17467f56668bf08fb266af19.jpg) | Add to Reading ListSource URL: math.ucsd.eduLanguage: English - Date: 2002-01-14 17:15:00
|
---|
9![Proof complexity of propositional default logic Proof complexity of propositional default logic](https://www.pdfsearch.io/img/27a10de0869150b9062540ca0fec582b.jpg) | Add to Reading ListSource URL: eprints.whiterose.ac.ukLanguage: English - Date: 2014-06-05 13:45:53
|
---|
10![ON THE PROOF COMPLEXITY OF DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI ABSTRACT. We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, ON THE PROOF COMPLEXITY OF DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI ABSTRACT. We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones,](https://www.pdfsearch.io/img/579a0116680b4fa946d57e1d10e8cd70.jpg) | Add to Reading ListSource URL: cs.bath.ac.ukLanguage: English - Date: 2009-04-19 15:07:07
|
---|