A simplified lower bound for implicational logic

03/27/2023

∙

by   Emil Jeřábek, et al.

∙

0

∙

share

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.