This chapter is a general introduction to some of the themes of propositional proof complexity. We introduce on a high level proof systems such as resolution and polynomial calculus, we recall some connections between proof complexity and SAT algorithms, and we introduce on a high level the topic of space in propositional proof systems. We conclude with a summary of the results shown in this book.
Unable to display preview. Download preview PDF.