4 problems
- 0 votes0 replies1 view
Non-polynomial simulation of KS with cocontraction by KS
Let be the minimal complete fragment of a standard deep inference system for propositional logic, and let be its extension b…
- 0 votes0 replies1 view
Polynomial simulation of Frege systems by KS with cocontraction
Let be the minimal complete fragment of a standard deep inference system for propositional logic, and let denote its extensi…
- 0 votes0 replies0 views
Stewart–Stouppa conjecture on deep inference systems for modal frame conditions
Stewart and Stouppa study deep inference rules for modal axioms, where inference rules act as term-rewriting rules on formulas and derivations are reduction sequences. Stewart–Stou…
- 0 votes0 replies0 views
Exponential lower bound for analytic bounded-depth CoS proofs of \mathsf{DT} tautologies
Exponential-growth conjecture. In any analytic bounded-depth CoS proof system, the tautologies in only have proofs that grow exponentially in their size.