Name
Abstract | ||
|---|---|---|
We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show that these theories are stronger than the original one. More explicitly we will see that polylogarithmic cuts of models of V-0 are models of VNC1 by formalizing a proof of Nepomnjascij's Theorem in such cuts. This is a strengthening of a result by Paris and Wilkie. We can then exploit our result in Proof Complexity to observe that Frege proof systems can be sub exponentially simulated by bounded depth Frege proof systems. This result has recently been obtained by Filmus, Pitassi and Santhanam in a direct proof. As an interesting observation we also obtain an average case separation of Resolution from AC(0)-Frege by applying a recent result with Tzameret. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.2168/LMCS-9(1:16)2013 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | Field | DocType |
Proof Complexity,Bounded Arithmetic,Cuts,Subexponential Simulation | Discrete mathematics,Combinatorics,Proof complexity,Mathematics,Bounded function,Direct proof | Journal |
Volume | Issue | ISSN |
9 | 1 | 1860-5974 |
Citations | PageRank | References |
1 | 0.48 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Müller | 1 | 63 | 13.40 |