A simplified lower bound for implicational logic

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.

Paper

Similar papers

© 2026 NYSGPT2525 LLC