Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the complexity of finding falsifying assignments for Herbrand disjunctions (1411.3304v1)

Published 12 Nov 2014 in cs.LO and math.LO

Abstract: Suppose that $\Phi$ is a consistent sentence. Then there is no Herbrand proof of $\neg \Phi$, which means that any Herbrand disjunction made from the prenex form of $\neg \Phi$ is falsifiable. We show that the problem of finding such a falsifying assignment is hard in the following sense. For every total polynomial search problem $R$, there exists a consistent $\Phi$ such that finding solutions to $R$ can be reduced to finding a falsifying assignment to an Herbrand disjunction made from $\neg \Phi$. It has been conjectured that there are no complete total polynomial search problems. If this conjecture is true, then for every consistent sentence $\Phi$, there exists a consistence sentence $\Psi$, such that the search problem associated with $\Psi$ cannot be reduced to the search problem associated with $\Phi$.

Citations (15)

Summary

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