Comments on Beckmann's Uniform Reducts
Computational Complexity
2007-05-23 v2
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 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.
Keywords
Cite
@article{arxiv.cs/0601086,
title = {Comments on Beckmann's Uniform Reducts},
author = {Stephen Cook},
journal= {arXiv preprint arXiv:cs/0601086},
year = {2007}
}