### Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

##### Susanna F. de Rezende

### Proof complexity of logics of bounded branching, Part 2

##### Emil Jeřábek

On the other hand, for typical logics of bounded width, the EF and SF systems are p-equivalent, and they are in a certain sense p-equivalent to the classical EF system, for which we do not know any lower bounds, and even candidate hard tautologies are scarce.

The main ingredients in all the lower bounds above (as well as similar bounds for superintuitionistic logics) were variants of the feasible disjunction property (DP), playing a role similar to feasible interpolation in classical proof systems.

This raises the question what happens for... more

### Proof complexity of logics of bounded branching

##### Emil Jeřábek

On the other hand, for typical logics of bounded width, the EF and SF systems are p-equivalent, and they are in a certain sense p-equivalent to the classical EF system, for which we do not know any lower bounds, and even candidate hard tautologies are scarce.

The main ingredients in all the lower bounds above (as well as similar bounds for superintuitionistic logics) were variants of the feasible disjunction property (DP), playing a role similar to feasible interpolation in classical proof systems.

This raises the question what happens for... more