English
Related papers

Related papers: Undecidability in number theory

200 papers

Here we continue with the ideas expressed in "On the strangeness of quantum mechanics" aiming to demonstrate more concretely how this philosophical outlook might be used as a key for resolving the measurement problem. We will address in…

Quantum Physics · Physics 2023-03-13 Marcello Poletti

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,…

Logic · Mathematics 2011-09-14 Kirsten Eisentraeger , Graham Everest , Alexandra Shlapentokh

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,…

Logic in Computer Science · Computer Science 2018-05-07 Alexis Bès , Christian Choffrut

We show that the ring of integers of $\mathbb{Q}^{\text{tr}}$ is existentially definable in the ring of integers of $\mathbb{Q}^{\text{tr}}(i)$, where $\mathbb{Q}^{\text{tr}}$ denotes the field of all totally real numbers. This implies that…

Number Theory · Mathematics 2024-02-21 Caleb Springer

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

Computational Complexity · Computer Science 2023-10-18 Matthias C. Caro

One of the main open problems regarding decidability of the existential theory of rings is the analogue of Hilbert's Tenth Problem (HTP) for the ring of entire holomorphic functions in one variable. In the direction of a negative solution,…

Number Theory · Mathematics 2021-11-08 D. Chompitaki , N. Garcia-Fritz , H. Pasten , T. Pheidas , X. Vidaux

It is known that Hilbert's Tenth Problem over the Gaussian ring $\mathbb Z[i]=\{a+bi:\ a,b\in\mathbb Z\}$ is undecidable. In this paper we obtain the following further result: There is no algorithm to decide whether an arbitrarily given…

Number Theory · Mathematics 2025-10-22 Yuri Matiyasevich , Zhi-Wei Sun

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

Number Theory · Mathematics 2026-04-09 Angelot Behajaina , Pierre Dèbes , Joachim König

I investigate the question whether G\"odel's undecidability theorems play a crucial role in the search for a unified theory of physics. I conclude that unless the structure of space-time is fundamentally discrete we can never decide whether…

General Relativity and Quantum Cosmology · Physics 2024-02-27 Claus Kiefer

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

Number Theory · Mathematics 2019-07-30 Peter Müller

In the context of Hilbert's tenth problem, an outstanding open case is that of complex entire functions in one variable. A negative solution is known for polynomials (by Denef) and for exponential polynomials of finite order (by Chompitaki,…

Logic · Mathematics 2023-08-11 Natalia Garcia-Fritz , Hector Pasten

We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…

Formal Languages and Automata Theory · Computer Science 2022-05-03 Joel D. Day , Vijay Ganesh , Nathan Grewal , Florin Manea

Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for…

Number Theory · Mathematics 2007-05-23 Kirsten Eisentraeger

We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…

Number Theory · Mathematics 2014-10-23 Alexandra Shlapentokh

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…

Logic · Mathematics 2017-11-28 Thanases Pheidas , Xavier Vidaux

After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics.

Logic · Mathematics 2017-04-03 Bjorn Poonen

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) =…

Number Theory · Mathematics 2025-10-23 Bjorn Poonen

In this article, we explore the notion of infinity by studying Cantor's contribution to this field. A brief history of set theory is given. As an example of infinity, we consider Hilbert's famous hotel. A graphical construction is used to…

History and Overview · Mathematics 2024-03-20 Michel Ades , David Guillemette , Serge B. Provost

We show that the nonlinear real arithmetic theory (NRA) as defined in the SMTLIB standard is undecidable. The undecidability arises from the treatment of division by zero as an uninterpreted function, which allows encoding integer…

Logic in Computer Science · Computer Science 2026-05-27 Dejan Jovanovic