The number of axioms
Annals of Pure and Applied Logic(2022)
摘要
We derive results concerning the least possible number of distinct axioms in proofs in classical and intuitionistic sequent calculi and other related systems. In particular, we show that there is no recursive bound on the least possible number of distinct axioms in a proof of a provable sequent in terms of the sequent's length, and that there is no elementary bound on the least possible number of axioms in a cut-free proof of a provable sequent in terms of the least possible length of an arbitrary proof thereof, strengthening a classical result due to Orevkov and Statman. (c) 2022 Elsevier B.V. All rights reserved.
更多查看译文
关键词
Number of axioms,Sequent calculus,Cut elimination,LK
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要