2000 character limit reached
A simplified lower bound for implicational logic (2303.15090v3)
Published 27 Mar 2023 in cs.LO and math.LO
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.