A simplified lower bound for implicational logic
Logic in Computer Science
2025-10-22 v4 Logic
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.
Keywords
Cite
@article{arxiv.2303.15090,
title = {A simplified lower bound for implicational logic},
author = {Emil Jeřábek},
journal= {arXiv preprint arXiv:2303.15090},
year = {2025}
}
Comments
32 pages; minor updates