Propositional Proof Complexity

Propositional proof complexity studies efficient provability of statements that can be expressed in quantifier-free form, in various proof systems and under various notions of “efficiency”. Statement