Comments on Beckmann's Uniform Reducts

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-9337

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.