Abstract:

Two fundamental complexity parameters of a propositional proof are its
length, typically measured by the number of lines appearing in it, and 
its space which roughly corresponds to the minimal size of the blackboard 
(or computer memory) needed to verify the steps of the proof.
In this talk we will discuss the connection between these two parameters 
for several basic proof systems. 

Joint work with Jakob Nordstrom.