In [GH1] and [GH2] (see also [GH3]) we presented full proof of the equalities NP = coNP = PSPACE. These results have been obtained by the novel proof theoretic tree-to-dag compressing techniques adapted to Prawitz's Natural Deduction (ND) for propositional minimal logic coupled with the corresponding Hudelmaier's cutfree sequent calculus. In this paper we propose an overview of our proofs.

翻译：在[GH1]和[GH2]中(另见[GH3]),我们充分证明了平等性,NP = CNP = PSPACE。这些结果都是通过新颖的证据获得的。根据普劳维茨的自然降温(ND)的假设最低逻辑,加上相应的Hudelmaier的断层序列计算,我们提出了我们的证据概览。