35 citations · 115 across the 15 of their papers we have counts for
1 paper · 2 filters
Emil Jeřábek
For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP th…