For a ring R, Hilbert’s Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to these subrings, which naturally form a topological space, relates their sets HTP(R) to the set HTP(ℚ), whose decidability remains an open question. The main result is that, for an arbitrary set C, HTP(ℚ) computes C if and only if the subrings R for which HTP(R) computes C form a nonmeager class. Similar results hold for 1-reducibility, for admitting a Diophantine model of ℤ, and for existential definability of ℤ.
CITATION STYLE
Miller, R. (2016). Baire category theory and hilbert’s tenth problem inside ℚ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9709, pp. 343–352). Springer Verlag. https://doi.org/10.1007/978-3-319-40189-8_35
Mendeley helps you to discover research relevant for your work.