2 citations · 4 across the 6 of their papers we have counts for
4 papers · 1 filter
On proof theory in computational complexity: overview
L. Gordeev, E. H. Haeusler
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 compress…
Going from the huge to the small: Efficient succinct representation of proofs in Minimal implicational logic
Edward Hermann Haeusler
A previous article shows that any linear height bounded normal proof of a tautology in the Natural Deduction for Minimal implicational logic is as huge as it is redun…
Yet another argument in favour of NP=CoNP
Edward Hermann Haeusler
This article shows yet another proof of NP=CoNP$. In a previous article, we proved that NP=PSPACE and from it we can conclude that NP=CoNP immediately. The former proof shows how t…
On proof theory in computer science
L. Gordeev, E. H. Haeusler
The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced…