Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0
Abstract
Let K be a one-variable function field over a field of constants of characteristic 0. Let R be a holomorphy subring of K, not equal to K. We prove the following undecidability results for R: If K is recursive, then Hilbert's Tenth Problem is undecidable in R. In general, there exist x1,...,xn ∈ R such that there is no algorithm to tell whether a polynomial equation with coefficients in (x1,...,xn) has solutions in R.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.