Comments on Beckmann's Uniform Reducts

Details Comments on Beckmann's Uniform Reducts Comments on Beckmann's Uniform Reducts

2006-01-19

arxiv.org/abs/cs/0601086v2

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Comments on Beckmann's Uniform Reducts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comments on Beckmann's Uniform Reducts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comments on Beckmann's Uniform Reducts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9337