Interesting Esoterica on Nostr: Division by zero Article by Emil Jeřábek In collection: About proof As a ...
Division by zero
Article by Emil Jeřábek
In collection: About proof
As a consequence of the MRDP theorem, the set of Diophantine equations provably unsolvable in any sufficiently strong theory of arithmetic is algorithmically undecidable. In contrast, we show the decidability of Diophantine equations provably unsolvable in Robinson's arithmetic Q. The argument hinges on an analysis of a particular class...
URL: http://arxiv.org/abs/1604.07309
PDF: http://arxiv.org/pdf/1604.07309v1
Entry: https://read.somethingorotherwhatever.com/entry/Jerabek2016
Article by Emil Jeřábek
In collection: About proof
As a consequence of the MRDP theorem, the set of Diophantine equations provably unsolvable in any sufficiently strong theory of arithmetic is algorithmically undecidable. In contrast, we show the decidability of Diophantine equations provably unsolvable in Robinson's arithmetic Q. The argument hinges on an analysis of a particular class...
URL: http://arxiv.org/abs/1604.07309
PDF: http://arxiv.org/pdf/1604.07309v1
Entry: https://read.somethingorotherwhatever.com/entry/Jerabek2016