English
Related papers

Related papers: Finite Undecidability in Fields I: NIP Fields

200 papers

We construct the so-called quasiregular representations of the group $B_0^{\mathbb N}({\mathbb F}_p)$ of infinite upper triangular matrices with coefficients in a finite field and give the criteria of theirs irreducibility in terms of the…

Representation Theory · Mathematics 2017-02-01 Alexandre Kosyak

Let K be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map.…

Logic · Mathematics 2012-04-16 Joseph Flenner

We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…

Logic · Mathematics 2020-11-12 Carlos Martinez-Ranero , Javier Utreras , Xavier Vidaux

We prove that if K is an infinite stable field whose generic type has weight 1 then K is separably closed. We also obtain partial results when the generic of K has finite weight and when K is strongly stable.

Logic · Mathematics 2009-10-01 Krzysztof Krupinski , Anand Pillay

Let $K$ be an algebrically closed field and let $n\geq 1$. If $P\in K[X]=K[X_1,\ldots,X_n]$, $P\neq 0$, we denote by $I(P)$ the support of $P$, which is the finite subset of $\mathbb N^n$ such that $P=\sum_{i\in I(P)}a_iX^i$ with $a_i\in…

Commutative Algebra · Mathematics 2010-08-31 Constantin-Nicolae Beli

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

Fields with only finitely many maximal subrings are completely determined. We show that such fields are certain absolutely algebraic fields and give some characterization of them. In particular, we show that the following conditions are…

Commutative Algebra · Mathematics 2014-12-17 Alborz Azarang

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…

Number Theory · Mathematics 2023-10-17 Dong Quan Ngoc Nguyen

We produce new examples of totally imaginary infinite extensions of $\mathbb{Q}$ which have undecidable first-order theory by generalizing the methods used by Martinez-Ranero, Utreras and Videla for $\mathbb{Q}^{(2)}$. In particular, we use…

Number Theory · Mathematics 2020-06-02 Caleb Springer

We show that separably closed valued fields of finite imperfection degree (either with lambda-functions or commuting Hasse derivations) eliminate imaginaries in the geometric language. We then use this classification of interpretable sets…

Logic · Mathematics 2018-02-14 Martin Hils , Moshe Kamensky , Silvain Rideau

We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…

Logic · Mathematics 2025-03-05 Annalisa Conversano

First-order predicate logic extended with linear arithmetic is undecidable, in general. We show that the Bernays-Sch\"onfinkel-Ramsey (BSR) fragment extended with linear arithmetic restricted to simple bounds (SB) is decidable through…

Logic in Computer Science · Computer Science 2020-01-07 Marco Voigt , Christoph Weidenbach

In this paper, we show that the $\exists^1 \forall^1$ theories of Hilbertian fields with charateristic 0 and perfect Hilbertian fields are both decidable. We also prove that the $\forall^1 \exists^1$ theories of Hilbertian fields with…

Logic · Mathematics 2020-10-23 Chun-Yu Lin

Let K be a field with a valuation satisfying the following conditions: both K and the residue field k have characteristic zero; the value group is not 2-divisible; there exists a maximal subfield F in the valuation ring such that…

Number Theory · Mathematics 2009-02-03 Jeroen Demeyer

It is undecidable whether the language recognized by a probabilistic finite automaton is empty. Several other undecidability results, in particular regarding problems about matrix products, are based on this important theorem. We present…

Formal Languages and Automata Theory · Computer Science 2024-06-07 Günter Rote

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…

Logic in Computer Science · Computer Science 2014-06-03 Tony Tan , Jan Van den Bussche , Xiaowang Zhang

Let $p$ be a prime number, $K$ be the henselization of the rational functions over the finite field $\mathbb{F}_p$ and $R$ be the ring of additive polynomials over K. We show that the field of Laurent series over $\mathbb{F}_p$ is decidable…

Logic · Mathematics 2018-10-10 Gönenç Onay

We survey a number of incompleteness results in operator algebras stemming from the recent undecidability result in quantum complexity theory known as $\operatorname{MIP}^*=\operatorname{RE}$, the most prominent of which is the G\"odelian…

Logic · Mathematics 2024-09-16 Isaac Goldbring

We give sufficent conditions for a derivation of a $k$-algebra $A$ of finite type to be $\infty$-integrable in the sense of Hasse-Schmidt, when $A$ is a complete intersection, or when $A$ is reduced and $k$ is a regular ring. As a…

Commutative Algebra · Mathematics 2024-10-01 A. Bravo , María de la Paz Tirado Hernández

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…

Logic · Mathematics 2009-01-19 Laurent Moret-Bailly , Alexandra Shlapentokh