Nathan Segerlind The Complexity of Propositional Proofs. 417-481 2007 13 Bulletin of Symbolic Logic 4 http://www.math.ucla.edu/~asl/bsl/1304/1304-001.ps db/journals/bsl/bsl13.html#Segerlind07