加载中…
2023-03-27
A simplified lower bound for implicational logic
Emil Jeřábek
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本