P-Optimal Proof Systems for Each coNP-Complete Set and no Complete Problems in NP∩coNP Relative to an Oracle
share
We build on a working program initiated by Pudlák [Pud17] and construct an oracle relative to which each coNP-complete set has P-optimal proof systems and NP∩coNP does not have complete problems.
READ FULL TEXT