In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier's cut-free sequent calculus for minimal logic (HSC) [5] with the horizontal compressing in the corresponding minimal Prawitz-style natural deduction (ND) [6]. In this Addendum we show how to prove a weaker result NP = coNP without referring to HSC. The underlying idea (due to the second author) is to omit full minimal logic and compress only \naive" normal tree-like ND refutations of the existence of Hamiltonian cycles in given non-Hamiltonian graphs, since the Hamiltonian graph problem in NP-complete. Thus, loosely speaking, the proof of NP = coNP can be obtained by HSC-elimination from our proof of NP = PSPACE [3]. [3] L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE II, Bulletin of the Section of Logic (49) (3): 213-230 (2020) http://dx.doi.org/10.18788/0138-0680.2020.16 [1907.03858] [5] J. Hudelmaier, An O (n log n)-space decision procedure for intuitionistic propositional logic, J. Logic Computat. (3): 1-13 (1993) [6] D. Prawitz, Natural deduction: a proof-theoretical study. Almqvist & Wiksell, 1965
翻译：在[3]中,我们用先进的证明理论理论方法证明了NP=PSPACE的推测性 NP = PSPACE, 将Hudelmaier的无序序列计算法结合为最低逻辑(HSC) [5] 与相应的微小Prawitz式自然扣减(ND)的横向压缩结合起来。在本增编中,我们展示了如何在不提及HSC的情况下证明NP= CoNP的较弱结果[3].L. Gordeev、E. H. Heeusler、Compress Conpression 和NP Versus PSPACE II, 逻辑部分公报(49) : 288-80-LOrassion (20) ral-ral-ral-ral-ral-ral-ral-ral-rum (20) ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-ral-r. ral-r. r. r. http://2-l-r. r. r. rx-rx-l-l-rx-l-rx-l-l-rx-r) an-r. an-l-r. an-r. an-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l
相关内容
微信扫码咨询专知VIP会员