P-Optimal Proof Systems for Each Set in coNP and no Complete Problems in NP∩coNP Relative to an Oracle

10/18/2019

∙

by   Titus Dose, et al.

∙

0

∙

share

We build on a working program initiated by Pudlák [Pud17] and construct an oracle relative to which each set in coNP has P-optimal proof systems and NP∩coNP does not have complete problems.