The canonical pairs of bounded depth Frege systems

by   Pavel Pudlak, et al.

The canonical pair of a proof system P is the pair of disjoint NP sets where one set is the set of all satisfiable CNF formulas and the other is the set of CNF formulas that have P-proofs bounded by some polynomial. We give a combinatorial characterization of the canonical pairs of depth d Frege systems. Our characterization is based on certain games, introduced in this article, that are parametrized by a number k, also called the depth. We show that the canonical pair of a depth d Frege system is polynomially equivalent to the pair (A_d+2,B_d+2) where A_d+2 (respectively, B_d+1) are depth d+1 games in which Player I (Player II) has a positional winning strategy. Although this characterization is stated in terms of games, we will show that these combinatorial structures can be viewed as generalizations of monotone Boolean circuits. In particular, depth 1 games are essentially monotone Boolean circuits. Thus we get a generalization of the monotone feasible interpolation for Resolution, which is a property that enables one to reduce the task of proving lower bounds on the size of refutations to lower bounds on the size of monotone Boolean circuits. However, we do not have a method yet for proving lower bounds on the size of depth d games for d>1.


page 1

page 2

page 3

page 4


Top-Down Lower Bounds for Depth-Four Circuits

We present a top-down lower-bound method for depth-4 boolean circuits. I...

On Protocols for Monotone Feasible Interpolation

Feasible interpolation is a general technique for proving proof complexi...

Constant-depth circuits vs. monotone circuits

We establish new separations between the power of monotone and general (...

Low-depth arithmetic circuit lower bounds via shifted partials

We prove super-polynomial lower bounds for low-depth arithmetic circuits...

Karchmer-Wigderson Games for Hazard-free Computation

We present a Karchmer-Wigderson game to study the complexity of hazard-f...

Frame-validity games and lower bounds on the complexity of modal axioms

We introduce frame-equivalence games tailored for reasoning about the si...

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth

In this paper we give a characterization of both Boolean and arithmetic ...

Please sign up or login with your details

Forgot password? Click here to reset