English
Related papers

Related papers: Finite Undecidability in Fields I: NIP Fields

200 papers

In his unpublished preprint "Definable Valuations" Koenigsmann shows that every field that admits a t-henselian topology is either real closed or separably closed or admits a definable valuation inducing the t-henselian topology. To show…

Logic · Mathematics 2016-03-31 Katharina Dupont

Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…

Combinatorics · Mathematics 2025-08-04 Chao Yang , Zhujun Zhang

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 stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.

Algebraic Geometry · Mathematics 2009-03-25 Jean-Pierre Serre

We show that any positive characteristic tame Hahn field $\mathbb{F}((t^\Gamma))$ containing $t$ is decidable in $\mathcal{L}_t$, the language of valued fields with a constant symbol for $t$, if $\mathbb{F}$ and $\Gamma$ are decidable. In…

Logic · Mathematics 2023-12-29 Victor Lisinski

The famous Jacobian Conjecture asks if a morphism $f:K[x,y]\to K[x,y]$ with invertible Jacobian, is invertible ($K$ is a characteristic zero field). A known result says that if $K[f(x),f(y)] \subseteq K[x,y]$ is an integral extension, then…

Commutative Algebra · Mathematics 2015-06-18 Vered Moskowicz

For a prime ideal $\mathfrak{P}$ of the ring of integers of a number field $K$, we give a general definition of $\mathfrak{P}$-adic continued fraction, which also includes classical definitions of continued fractions in the field of…

Number Theory · Mathematics 2025-12-01 Laura Capuano , Nadir Murru , Lea Terracini

We prove that there are single Henkin quantifiers such that first order logic augmented by one of these quantifiers is undecidable in the empty vocabulary. Examples of such quantifiers are given.

Logic · Mathematics 2016-12-22 Konrad Zdanowski

This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…

Logic · Mathematics 2025-01-07 Paul Z. Wang

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

Group Theory · Mathematics 2020-03-25 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

Let $K/\mathbf{Q}_p$ be an unramified extension of degree $f$ with residue field $k$. Let $\sigma$ be an irreducible representation of $\mathrm{GL}_n(k)$ over $\overline{\mathbf{F}}_p$. For $n\ge 3$, we prove that the universal…

Number Theory · Mathematics 2026-05-19 Zachary Feng , Heejong Lee , Ray Li , Vaughan McDonald , Nischay Reddy

It was noticed by Harel in [Har86] that "one can define $\Sigma_1^1$-complete versions of the well-known Post Correspondence Problem". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a…

Logic in Computer Science · Computer Science 2013-03-06 Olivier Finkel

Let $K$ be a number field, let $L$ be an algebraic (possibly infinite degree) extension of $K$, and let $O_K$ $\subset$ $O_L$ be their rings of integers. Suppose $A$ is an abelian variety defined over $K$ such that $A(K)$ is infinite and…

Number Theory · Mathematics 2023-12-27 Barry Mazur , Karl Rubin , Alexandra Shlapentokh

Given a rational map $\phi: {\mathbb P}^1\to {\mathbb P}^1$ defined over a number field $K$, we prove a finiteness result for $\phi$-preperiodic points which are $S$-integral with respect to a non-preperiodic point $P$, provided $P$…

Number Theory · Mathematics 2014-02-26 Clayton Petsche

Let $p$ and $q$ be two distinct odd primes. Let $K$ be an imaginary quadratic field over which $p$ and $q$ are both split. Let $\Psi$ be a Hecke character over $K$ of infinity type $(k,j)$ with $0\le-j< k$. Under certain technical…

Number Theory · Mathematics 2023-02-28 Debanjana Kundu , Antonio Lei

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

Logic in Computer Science · Computer Science 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer

We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate…

Logic · Mathematics 2025-04-01 Artem Chernikov , Nadja Hempel

We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature $(\lor,\perp,0,1)$, where `$\perp$' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable:…

Quantum Physics · Physics 2021-06-22 Tobias Fritz

We solve a well known and long-standing open problem in database theory, proving that Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds on the top of our Red Spider method which we developed in our…

Databases · Computer Science 2015-12-08 Tomasz Gogacz , Jerzy Marcinkowski
‹ Prev 1 8 9 10 Next ›