Related papers: Mixed quantifier prefixes over Diophantine equatio…

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

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…

For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine…

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…

Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…

For a positive proportion of primes $p$ and $q$, we prove that $\mathbb{Z}$ is Diophantine in the ring of integers of $\mathbb{Q}(\sqrt[3]{p},\sqrt{-q})$. This provides a new and explicit infinite family of number fields $K$ such that…

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…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

In this article we outline the methods that are used to prove undecidability of Hilbert's Tenth Problem for function fields of characteristic zero. Following Denef we show how rank one elliptic curves can be used to prove undecidability for…

In this paper we complete B\"{u}chi's proof that there is no decision algorithm for the solubility in integers of arbitrary systems of diagonal quadratic form equations, by proving the assertion that whenever $x_1^2, \cdots, x_5^2$ are five…

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

In this short note we study the existence and number of solutions in the set of integers ($Z$) and in the set of natural numbers ($N$) of Diopahntine Equations of second degree with two variables of the general form $ax^2-by^2=c$.

Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of…

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…

In this paper we show that there is no algorithm to decide whether an arbitrarily given polynomial equation $P(z_1,\ldots,z_{52})=0$ (with integer coefficients) over the Gaussian ring $\mathbb Z[i]$ is solvable.