关于大型自然演绎证明中的内在冗余PDKEEPAAA：解析$M_{\imply}$超多项式证明
On the Intrinsic Redundancy in Huge Natural Deduction proofs II: Analysing $M_{\imply}$ Super-Polynomial Proofs
摘要：
本文精确地定义了最小蕴涵命题逻辑\mil在自然演绎系统中的大型证明。这就是我们所说的超多项式证明的无限族。我们认为庞大的家庭扩大范式映射证明，设备明确帮助计数的E-部分正常的证明在一个适当的方式。因此，我们表明，几乎所有成员的超多项式家庭至少有一个子证明或推导他们每个人都是重复超多项式多次。最后一个属性我们称之为超多项式冗余。几乎所有，确切地说是指证明的结论有一个大小，每个结论大于这个大小的证明也是高度冗余的。这一结果指出了以前提出的压缩方法的改进和CoNP = NP的替代和更简单的证明。
英文摘要：
This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of expanded normal form mapped proofs, a device to explicitly help to count the E-parts of a normal proof in an adequate way. Thus, we show that for almost all members of a super-polynomial family there at least one sub-proof or derivation of each of them that is repeated super-polynomially many times. This last property we call super-polynomial redundancy. Almost all, precisely means that there is a size of the conclusion of proofs that every proof with conclusion bigger than this size and that is huge is highly redundant too. This result points out to a refinement of compression methods previously presented and an alternative and simpler proof that CoNP=NP.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
