A fundamental problem about the strength of non-deterministic computations is the problem
whether the complexity class \calN\calP is closed under complementation. The set TAUT …

This paper considers theories of bounded arithmetic that are predicative in the sense of
Nelson, that is, theories that are interpretable in Robinson's Q. We give a nearly exact …

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 size …