$\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
Computational Complexity
2020-01-10 v2 Logic in Computer Science
Abstract
We build on a working program initiated by Pudl\'ak [Pud17] and construct an oracle relative to which each -complete set has -optimal proof systems and does not have complete problems.
Cite
@article{arxiv.1910.08571,
title = {$\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},
author = {Titus Dose},
journal= {arXiv preprint arXiv:1910.08571},
year = {2020}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1904.06175, arXiv:1909.02839