9 citations · 10 across the 3 of their papers we have counts for
1 paper · 1 filter
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…