English
Related papers

Related papers: Defining $\mathbb Z$ using unit groups

200 papers

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

In this paper, we study questions of definability and decidability for infinite algebraic extensions ${\bf K}$ of $\mathbb{F}_p(t)$ and their subrings of $\mathcal{S}$-integral functions. We focus on fields ${\bf K}$ satisfying a local…

Number Theory · Mathematics 2025-01-17 Alexandra Shlapentokh , Caleb Springer

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

We show that for a global field $K$, every ring of $S$-integers has a universal first-order definition in $K$ with $10$ quantifiers. We also give a proof that every finite intersection of valuation rings of $K$ has an existential…

Number Theory · Mathematics 2024-02-02 Nicolas Daans

We show that ${\mathbb Z}$ is definable in ${\mathbb Q}$ by a universal first-order formula in the language of rings. We also present an $\forall\exists$-formula for ${\mathbb Z}$ in ${\mathbb Q}$ with just one universal quantifier. We…

Number Theory · Mathematics 2013-11-14 Jochen Koenigsmann

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

Logic · Mathematics 2019-07-02 Ziba Assadi , Saeed Salehi

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

We prove that Z in definable in Q by a formula with 2 universal quantifiers followed by 7 existential quantifiers. It follows that there is no algorithm for deciding, given an algebraic family of Q-morphisms, whether there exists one that…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…

Logic · Mathematics 2020-09-15 Ziba Assadi

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…

Logic in Computer Science · Computer Science 2019-03-14 Antti Kuusisto , Jeremy Meyers , Jonni Virtema

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

Logic · Mathematics 2015-06-26 Eudes Naziazeno

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

Number Theory · Mathematics 2026-01-29 Tommy Hofmann

We show that the complement of the ring of integers in a number field K is Diophantine. This means the set of ring of integers in K can be written as {t in K | for all x_1, ..., x_N in K, f(t,x_1, ..., x_N) is not 0}. We will use global…

Number Theory · Mathematics 2012-03-01 Jennifer Park

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…

Logic · Mathematics 2012-08-27 Antti Kuusisto , Jeremy Meyers , Jonni Virtema

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

Group Theory · Mathematics 2020-08-24 Nir Avni , Chen Meiri

In this paper, we study arbitrary models of the first-order theory of a ring $A$ where the additive group $A$ is a finitely generated abelian group. Following an earlier paper by this author, Alexei G. Myasnikov and Francis Oger, we call…

Logic · Mathematics 2026-03-31 Mahmood Sohrabi

Julia Robinson has given a first-order definition of the rational integers $\mathbb Z$ in the rational numbers $\mathbb Q$ by a formula $(\forall \exists \forall \exists)(F=0)$ where the $\forall$-quantifiers run over a total of 8…

Logic · Mathematics 2008-02-14 Gunther Cornelissen , Alexandra Shlapentokh

We show that the set of algebraic extensions $F$ of $\mathbb{Q}$ in which $\mathbb{Z}$ or the ring of integers $\mathcal{O}_F$ are definable is meager in the set of all algebraic extensions.

Logic · Mathematics 2021-10-15 Philip Dittmann , Arno Fehm

We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…

Logic in Computer Science · Computer Science 2025-07-22 Toghrul Karimov , Florian Luca , Joris Nieuwveld , Joël Ouaknine , James Worrell
‹ Prev 1 2 3 10 Next ›