Propositional representation of arithmetic proofs (Preliminary Version)

  • Authors:

  • Martin Dowd

  • Affiliations:

  • -

  • Venue:
  • STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
  • Year:
  • 1978

Quantified Score

Hi-index 0.00

Visualization

Abstract

Equations f@@@@ &equil; g@@@@ between polynomial time computable functions can be represented by sets of propositional formulas. If f@@@@ &equil; g@@@@ is provable in certain arithmetic systems, then polynomial length proofs of the representing formulas exist in certain propositional systems. Two cases of this phenomenon and a general theory are given.