This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...
Let C be the propositional calculus given by a standard SBL-algebra; C is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C i...