Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 39 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 12 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 456 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

New relations and separations of conjectures about incompleteness in the finite domain (1904.01362v2)

Published 2 Apr 2019 in math.LO and cs.CC

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 $\mathsf{TAUT}$, assuming the collapse of $\cal C$ and $\sf N{\cal C}$ (the nondeterministic version of $\cal C$) for some new classes $\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 ${\cal V}$ and ${\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 $\mathsf{TAUT}$ and existence of a complete problem for $\mathsf{TFNP}$ are independent of each other in relativized worlds which was not known before.

Citations (11)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)