We show that the semantic cutting planes proof system has feasible interpolation via monotone real circuits. This gives an exponential lower bound on proof length in the system, answering a question from . We also pose the following problem: can every multivariate non-decreasing function be expressed as a composition of non-decreasing functions in two… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.