Emergent Mind

$\mathrm{P}$-Optimal Proof Systems for Each $\mathrm{coNP}$-Complete Set and no Complete Problems in $\mathrm{NP}\cap\mathrm{coNP}$ Relative to an Oracle

(1910.08571)

Published Oct 18, 2019 in cs.CC and cs.LO

Abstract

We build on a working program initiated by Pudl\'ak [Pud17] and construct an oracle relative to which each $\mathrm{coNP}$-complete set has $\mathrm{P}$-optimal proof systems and $\mathrm{NP}\cap\mathrm{coNP}$ does not have complete problems.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.