Hilbert's 10th Problem for solutions in a subring of Q

DOI10.7561/SACS.2019.1.101arXiv1909.05021MaRDI QIDQ6325083FDOQ6325083

Publication date: 8 September 2019

Abstract: Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smory'nski's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether or not the equation has a solution in R. We prove that a positive solution to H_{10}(R) implies that the set of all Diophantine equations with a finite number of solutions in R is recursively enumerable. We show the converse implication for every infinite set R subseteq Q such that there exist computable functions au_1, au_2:N o Z which satisfy (forall n in N au_2(n) eq 0) wedge ({frac{ au_1(n)}{ au_2(n)}: n in N}=R). This implication for R=N guarantees that Smory'nski's theorem follows from Matiyasevich's theorem. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have a rational solution is not recursive. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have only finitely many rational solutions is not recursively enumerable. These conjectures are equivalent by our results for R=Q.

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Decidability (number-theoretic aspects) (11U05)

This page was built for publication: Hilbert's 10th Problem for solutions in a subring of Q

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325083)