9 citations · 10 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
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…
cs.CC2016★ 1 cited
NP vs PSPACE
Lew Gordeev, Edward Hermann Haeusler
We present a proof of the conjecture = by showing that arbitrary tautologies of Johansson's minimal propositional logic admit "small" polynomial-s…