English
Related papers

Related papers: Finite Undecidability in Fields I: NIP Fields

200 papers

The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig…

Logic in Computer Science · Computer Science 2024-04-04 Frank Wolter , Michael Zakharyaschev

We give model theoretic criteria for $\exists \forall$ and $\forall \exists$- formulas in the ring language to define uniformly the valuation rings $\mathcal{O}$ of models $(K, \mathcal{O})$ of an elementary theory $\Sigma$ of henselian…

Commutative Algebra · Mathematics 2014-02-07 Alexander Prestel

We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

Logic · Mathematics 2023-11-02 Philip Dittmann , Florian Pop

We show that every fsg group externally definable in an NIP structure is definably isomorphic to a group interpretable in it. Our proof relies on honest definitions and a group chunk result reconstructing a hyper-definable group from its…

Logic · Mathematics 2025-07-01 Artem Chernikov

The tilting correspondence is a fundamental property of perfectoid fields. In this note, we show that the tilting construction can also be used to detect perfectoid fields among nonarchimedean fields. In particular, for $K$ a complete…

Number Theory · Mathematics 2023-01-24 Ehsan Shahoseini , Kiran S. Kedlaya

In the 60's, Berger famously showed that translational tilings of $\mathbb{Z}^2$ with multiple tiles are algorithmically undecidable. Recently, Bhattacharya proved the decidability of translational monotilings (tilings by translations of a…

Combinatorics · Mathematics 2023-10-26 Rachel Greenfeld , Terence Tao

We give an affirmative answer to the following question by Jarden and Narkiewicz: Is it true that every number field has a finite extension L such that the ring of integers of L is generated by its units (as a ring)? As a part of the proof,…

Number Theory · Mathematics 2012-04-03 Christopher Frei

We study the theory of a global field k as a k-vector space with a predicate for one of the absolute values on k. For example, we prove that in this language a global field with an ultrametric or real archimedean absolute value has a…

Logic · Mathematics 2026-03-27 Arno Fehm , Pierre Touchard

Let $G$ be a definable group in a $p$-adically closed field $M$. We show that $G$ has finitely satisfiable generics (fsg) if and only if $G$ is definably compact. The case $M = \mathbb{Q}_p$ was previously proved by Onshuus and Pillay.

Logic · Mathematics 2022-03-30 Will Johnson

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

Logic · Mathematics 2022-08-23 Will Johnson

It is well known that whenever a class of structures $\mathcal{K}_1$ is interpretable in a class of structures $\mathcal{K}_2$, then the hereditary undecidability of (a fragment of) the theory of $\mathcal{K}_1$ implies the hereditary…

Logic · Mathematics 2024-05-15 Vladimir E. Karpov

Consider a Henselian rank one valued field $K$ of equicharacteristic zero along with the language $\mathcal{L}^{P}$ of Denef--Pas. Let $f: A \to K$ be an $\mathcal{L}^{P}$-definable (with parameters) function on a subset $A$ of $K^{n}$. We…

Algebraic Geometry · Mathematics 2017-02-28 Krzysztof Jan Nowak

We give explicit formulas witnessing IP, \IPn or TP2 in fields with Artin-Schreier extensions. We use them to control $p$-extensions of mixed characteristic henselian valued fields, allowing us most notably to generalize to the \NIPn…

Logic · Mathematics 2024-09-20 Blaise Boissonneau

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

Logic · Mathematics 2025-06-23 Søren Brinck Knudstorp

We prove that if R is a Hensel local ring with infinite residue field k, the natural map H_i(GL(n,R),Z/p) ---> H_i(GL(n,k),Z/p) is an isomorphism for i <=3, p distinct from char(k). This implies rigidity for H_i(GL_n), i <=3, which in turn…

K-Theory and Homology · Mathematics 2007-05-23 Kevin P. Knudson

Let G be an algebraic group defined over an algebraically closed field k of characteristic zero. We give a simple proof of the following result: if H^1(L, G) = {1} for some finitely generated field extension L/k of transcendence degree \ge…

Algebraic Geometry · Mathematics 2007-05-23 Zinovy Reichstein , Boris Youssin

We prove some general estimates for exponential sums over subsets of finite fields which are definable in the language of rings. This generalizes both the classical exponential sum estimates over varieties over finite fields due to Weil,…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…

Category Theory · Mathematics 2009-06-01 Panagis Karazeris , Apostolos Matzaris , Jiri Velebil

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