English

New relations and separations of conjectures about incompleteness in the finite domain

Logic 2019-04-08 v2 Computational Complexity

Abstract

Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in \cite{pu18}. 2. We investigate the existence of p-optimal proof systems for TAUT\mathsf{TAUT}, assuming the collapse of C\cal C and NC\sf N{\cal C} (the nondeterministic version of C\cal C) for some new classes C\cal C and also prove new conditional independence results for strong theories, assuming nonexistence of p-optimal proof systems. 3. We construct two new oracles V{\cal V} and W{\cal W}. These two oracles imply several new separations of proof complexity conjectures in relativized worlds. Among them, we prove that existence of a p-optimal proof system for TAUT\mathsf{TAUT} and existence of a complete problem for TFNP\mathsf{TFNP} are independent of each other in relativized worlds which was not known before.

Keywords

Cite

@article{arxiv.1904.01362,
  title  = {New relations and separations of conjectures about incompleteness in the finite domain},
  author = {Erfan Khaniki},
  journal= {arXiv preprint arXiv:1904.01362},
  year   = {2019}
}