4 problems

Let $\mathcal{T}$ be the class of theories considered in the source, and let $\mathsf{TFNP}(T)$ and $\mathsf{TFNP}^*(T)$ denote the corresponding classes associated with…

Let $\mathcal T$ be the class of theories under consideration. For a consistent universal sentence $\Phi$, let $HCS(\Phi)$ be its Herbrand Consistency Search problem: given finitel…

Let $T\in\mathcal T$ be a theory axiomatized by a universal sentence, and let $HCS(T)$ denote its Herbrand Consistency Search problem. Universal-theory Herbrand consistency conject…

A TFNP problem is a total polynomial search problem, and polynomial reduction is the usual polynomial-time reduction between search problems. No complete TFNP problem conjecture. T…