Comments on Beckmann's Uniform Reducts
Abstract
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 fproofs. We prove that the uniform reduct of f + Extended Frege consists of all true bounded arithmetical formulas iff f + Extended Frege simulates every proof system.
 Publication:

arXiv eprints
 Pub Date:
 January 2006
 arXiv:
 arXiv:cs/0601086
 Bibcode:
 2006cs........1086C
 Keywords:

 Computer Science  Computational Complexity;
 F.4.1