pith. sign in

arxiv: 0805.3458 · v2 · submitted 2008-05-22 · 🧮 math.LO · math.AG· math.NT

Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0

classification 🧮 math.LO math.AGmath.NT
keywords characteristicfieldfunctionholomorphythereundecidabilityalgorithmcoefficients
0
0 comments X
read the original 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 $x_1,...,x_n \in R$ such that there is no algorithm to tell whether a polynomial equation with coefficients in $\Q(x_1,...,x_n)$ has solutions in $R$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.