A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimal proof systems imply complete sets for promise classes
2003
Information and Computation
A polynomial time computable function h : * → * whose range is a set L is called a proof system for L. In this setting, an h-proof for x ∈ L is just a string w with h(w) = x. Cook and Reckhow defined this concept in [13] , and in order to compare the relative strength of different proof systems for the set TAUT of tautologies in propositional logic, they considered the notion of p-simulation. Intuitively, a proof system h p-simulates h if any h-proof w can be translated in polynomial time into
doi:10.1016/s0890-5401(03)00058-0
fatcat:qrxbqqamdzhd7kucjc6mlcvtsq