2 citations · 4 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
On the Intrinsic Redundancy in Huge Natural Deduction proofs II: Analysing $M_{\imply}$ Super-Polynomial Proofs
Edward Hermann Haeusler
This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family o…
Exponentially Huge Natural Deduction proofs are Redundant: Preliminary results on
Edward Hermann Haeusler
We estimate the size of a labelled tree by comparing the amount of (labelled) nodes with the size of the set of labels. Roughly speaking, a exponentially big labelled tree, is any…