50 citations · 50 across the 3 of their papers we have counts for
1 paper · 1 filter
Stephen Cook
Arnold Beckmann defined the uniform reduct of a propositional proof system f to be the set of those bounded arithmetical formulas whose propositional translations have polynomial s…