Lower Bounds and Trade-offs in Proof Complexity

Propositional proof complexity is a field in theoretical computer science that analyses the resources needed to prove statements. In this thesis, we are concerned about the length of proofs and tra ...