We show that arbitrary tautologies of Johansson’s minimal propositional logic are provable
by “small” polynomial-size dag-like natural deductions in Prawitz’s system for minimal …

… In this paper we show a solution that proves the conjecture NP = PSPACE. To explain it
briefly first consider standard notion of provability. Recall that our basic deduction calculus NM→ …

… We present a proof of the conjecture NP = PSPACE by show… idea to attack a weaker
conjecture NP = coNP by reductions in … On the contrary, the attached proof of NP = PSPACE runs …

… A such that NP(A) is not equal to PSPACE(A). One would like to have positive properties of
NP relativize but this is not the case if NP = PSPACE since for the set A noted above NP(A) # …

… We shall prove the existence of a problem in NP and PSPACE-complete. Since, PSPACE
is closed under reductions and NP is contained in PSPACE, then we have that NP = PSPACE. …

… In MR q 97 , we proved that a number of graph theoretic problems are PSPACE-hard when
… , we show that several of these PSPACE-hard problems possess efficient approximation …

… NP given in this paper is the first one in terms of Formal Language Theory, likewise the one
for PSPACE … problems would imply co-NP ⊆ NP: Assume co-NP ⊆ NP, then the complement …

… If any NP-complete problem is in P, then P = NP. In this respect, there is no difference in
proving that 3SAT is in P and proving that CLIQUE is in P. Nevertheless, a particular problem …

… We also show that PSPACE equals the family of languages … We also show that PSPACE
equals the family of languages … Characterizing NP, P, and PSPACE is not sufficient but this …

We show that arbitrary tautologies of Johansson’s minimal propositional logic are provable
by “small” polynomial-size dag-like natural deductions in Prawitz’s system for minimal …