A simplified lower bound for implicational logic
arXiv:2303.15090 · doi:10.1017/bsl.2025.6
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.
32 pages; minor updates