NP vs PSPACE

We present a proof of the conjecture 𝒩𝒫 = 𝒫𝒮𝒫𝒜𝒞ℰ by showing that arbitrary tautologies of Johansson's minimal propositional logic admit "small" polynomial-size dag-like natural deductions in Prawitz's system for minimal propositional logic. These "small" deductions arise from standard "large" tree-like inputs by horizontal dag-like compression that is obtained by merging distinct nodes labeled with identical formulas occurring in horizontal sections of deductions involved. The underlying "geometric" idea: if the height, h( ∂) , and the total number of distinct formulas, ϕ( ∂) , of a given tree-like deduction ∂ of a minimal tautology ρ are both polynomial in the length of ρ, | ρ|, then the size of the horizontal dag-like compression is at most h( ∂) ×ϕ( ∂), and hence polynomial in | ρ|. The attached proof is due to the first author, but it was the second author who proposed an initial idea to attack a weaker conjecture 𝒩𝒫= 𝑐𝑜𝒩𝒫 by reductions in diverse natural deduction formalisms for propositional logic. That idea included interactive use of minimal, intuitionistic and classical formalisms, so its practical implementation was too involved. The attached proof of 𝒩𝒫=𝒫𝒮𝒫𝒜𝒞ℰ runs inside the natural deduction interpretation of Hudelmaier's cutfree sequent calculus for minimal logic.