Comments on Beckmann's Uniform Reducts
<|reference_start|>Comments on Beckmann's Uniform Reducts: 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 f-proofs. 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.<|reference_end|>
@article{cook2006comments,
    title={Comments on Beckmann's Uniform Reducts},
    author={Stephen Cook},
    journal={arXiv preprint arXiv:cs/0601086},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0601086},
    primaryClass={cs.CC}
}