Iterated lower bound formulas: a diagonalization-based approach to proof complexity
Rahul Santhanam, Iddo Tzameret · 2021
We propose a diagonalization-based approach to several important questions in proof complexity. We illustrate this approach in the context of the algebraic proof system IPS and in the context of propositional proof systems more generally.