A note on Jerabek's paper "A simplified lower bound for implicational logic"

Lev Gordeev, Edward Hermann Haeusler

In our previous papers we sketched proofs of the equality NP = coNP = PSPACE. These results have been obtained by proof theoretic tree-to-dag compressing techniques adapted to Praw…