Related papers: The Diophantine problem for rings of exponential p…

We prove that Hilbert's Tenth Problem for a ring of integers in a number field K has a negative answer if K satisfies two arithmetical conditions (existence of a so-called division-ample set of integers and of an elliptic curve of rank one…

We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…

Let $K$ be an imaginary quadratic field and $p$ be an odd prime which splits in $K$. Let $E_1$ and $E_2$ be elliptic curves over $K$ such that the $Gal(\bar{K}/K)$-modules $E_1[p]$ and $E_2[p]$ are isomorphic. We show that under certain…

This paper explores undecidability in theories of positive characteristic function fields in the "geometric" language of rings $\mathcal{L}_F = \{0, 1, +, \cdot, F\}$, with a unary predicate $F$ for nonconstant elements. In particular we…

Diophantine subsets of $\mathbb{Z}$ play a key role in the negative answer to Hilbert's tenth problem. The definition of diophantine set generalizes in several ways to other commutative rings. We compare these definitions. Along the way, we…

The recent negative answer to Hilbert's tenth problem over rings of integers relies on a theorem that for every extension of number fields $L/K$, if there is an abelian variety $A$ over $K$ such that $0 < \operatorname{rank} A(K) =…

Using an iterated Horner schema for evaluation of diophantine polynomials, we define a partial $\mu$-recursive "decision" algorithm decis as a "race" for a first nullstelle versus a first (internal) proof of non-nullity for such a…

We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…

Let k be a field of characteristic zero, V a smooth, positive-dimensional, quasiprojective variety over k, and D a nonempty effective divisor on V. Let K be the function field of V, and A the semilocal ring of D in K. In this paper, we…

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…

We prove an analogue of Hilbert's Tenth Problem for complex meromorphic functions. More precisely, we prove that the set of integers is positive existentially definable in fields of complex meromorphic functions in several variables over…

In this paper we first review the history of Hilbert's Tenth Problem, and then study mixed quantifier prefixes over Diophantine equations with integer variables. For example, we prove that $\forall^2\exists^4$ over $\mathbb Z$ is…

Let K be an algebraic function field of characteristic 2 with constant field C_K. Let C be the algebraic closure of a finite field in K. Assume that C has an extension of degree 2. Assume that there are elements u,x of K with u…

Based on the MRDP theorem concerning the Hilbert tenth problem, there is a corresponding Diophantine equation called proof equation for every formula of the First-order Peano Arithmetic (PA). A formula is provable in PA, if and only if the…

Let K be the function field of a variety of dimension at least 2 over an algebraically closed field of characteristic zero. Then Hilbert's Tenth Problem for K is undecidable. This generalizes the result by Kim and Roush from 1992 that…

This expository article covers the recent developments surrounding Hilbert's tenth problem for finitely generated rings. We start by recounting the history of Hilbert's tenth problem over the integers, which was resolved negatively by…

We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Let $K$ be a quadratic imaginary extension of $\mathbb{Q}$, let $S$ be a finite nonempty set of non archimedean places, and let $\mathcal{O}_{K,S}$ denote the ring of $S$-integers of $K$. We show that there is no algorithm which solves the…

These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…