[Proof Complexity] new preprint

[Emil Jerabek]

Dear all,

A new preprint, "A simplified lower bound for implicational logic", is
available on my web page at https://math.cas.cz/~jerabek/papers/papers.html .

Abstract: We present a streamlined and simplified exponential lower
bound on the length of proofs in intuitionistic implicational logic,
adapted to Gordeev and Haeusler's dag-like natural deduction.

Comments, correcions, and suggestion are most welcome.

Best regards,
Emil Jerabek