Hilbert's Tenth Problem in Coq

10 Mar 2020 Larchey-Wendling Dominique Forster Yannick

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the Davis-Putnam-Robinson-Matiyasevich theorem, stating that every recursively enumerable problem -- in our case by a Minsky machine -- is Diophantine... (read more)

PDF Abstract

Categories


  • LOGIC IN COMPUTER SCIENCE