Formalization of the MRDP Theorem in the Mizar System.

This article is the final step of our attempts to formalize the negative solution of Hilbert's tenth problem. In our approach, we work with the Pell's Equation defined in [2]. We analyzed this equation in the general case to show its solvability as well as the cardinality and shape of all possible solutions. Then we focus on a special case of the equation, which has the form x(2) - (a(2) - 1)y(2) = 1 [8] and its solutions considered as two sequences {x(i)(a)}(i=0)(infinity), {y(i)(a)}(i=0)(infinity). We showed in [1] that the n-th element of these sequences can be obtained from lists of several basic Diophantine relations as linear equations, finite products, congruences and inequalities, or more precisely that the equation x = y(i) (a) is Diophantine. Following the post-Matiyasevich results we show that the equality determined by the value of the power function y = x(z) is Diophantine, and analogously property in cases of the binomial coefficient, factorial and several product [9]. In this article, we combine analyzed so far Diophantine relation using conjunctions, alternatives as well as substitution to prove the bounded quantifier theorem. Based on this theorem we prove MDPR-theorem that every recursively enumerable set is Diophantine, where recursively enumerable sets have been defined by the Martin Davis normal form. The formalization by means of Mizar system [5], [7], [4] follows [10], Z. Adamowicz, P. Zbierski [3] as well as M. Davis [6].