1 problem

The horror conjecture. In the language of $T^+$, there are sentences $\tau_{g,p^k,n}$ depending recursively on the parameters such that, for every $g\geq 1$, every prime power…