English
Related papers

Related papers: Two examples concerning existential undecidability…

200 papers

Refining a constructive combinatorial method due to MacLane and Schilling, we give several criteria for a valued field that guarantee that all of its maximal immediate extensions have infinite transcendence degree. If the value group of the…

Commutative Algebra · Mathematics 2013-04-05 Anna Blaszczok , Franz-Viktor Kuhlmann

We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…

Information Theory · Computer Science 2022-02-11 Cheuk Ting Li

An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…

Logic · Mathematics 2013-03-21 Laurent Bienvenu , Rupert Hölzl , Adam R. Day

We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.

Probability · Mathematics 2010-08-13 Wolfgang Karcher , Hans-Peter Scheffler , Evgeny Spodarev

We classify Artin-Schreier extensions of valued fields with non-trivial defect according to whether they are connected with purely inseparable extensions with non-trivial defect, or not. We use this classification to show that in positive…

Commutative Algebra · Mathematics 2013-04-02 Franz-Viktor Kuhlmann

We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and…

Computational Complexity · Computer Science 2022-12-14 Prerona Chatterjee , Ramprasad Saptharishi

We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…

Number Theory · Mathematics 2013-06-13 Kirsten Eisentraeger , Alexandra Shlapentokh

It is shown that the compositum $ \mathbb Q^{(2)}$ of all degree 2 extensions of $\mathbb Q$ has undecidable theory.

Logic · Mathematics 2020-11-03 Carlos Martinez-Ranero , Javier Utreras , Carlos R. Videla

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

We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.

chao-dyn · Physics 2008-02-03 Karl Svozil

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

We consider properties of infinite algebraic extensions of global fields through their Tsfasman-Vladuts invariants (related in particular to the decomposition of primes). We use recent results of A. Schmidt and a weak effective version of…

Number Theory · Mathematics 2009-03-18 Philippe Lebacque

Let $K$ be a large field such that $K[\sqrt{-1}]$ is not algebraically closed and $F/K$ a function field in one variable. Extending techniques and results from earlier work with Becher and Dittmann, we show that every valuation ring on $F$…

Number Theory · Mathematics 2025-12-05 Nicolas Daans

We prove that an infinite field interpretable in a $p$-adically closed field $K$ is definably isomorphic to a finite extension of $K$. The result remains true in any $P$-minimal field where definable functions are generically…

Logic · Mathematics 2021-03-30 Yatir Halevi , Assaf Hasson , Ya'acov Peterzil

We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…

Logic · Mathematics 2025-06-18 Pavel Gvozdevsky

In 1987, Pheidas showed that the field of Laurent series $\mathbb{F}_q((t))$ with a constant for the indeterminate $t$ and a predicate for the natural powers $\{t^n \mid n > 0\}$ of $t$ is existentially undecidable. We show that the same…

Logic · Mathematics 2024-08-27 Leo Gitin

Let $\mathcal{K}=(K,v,\ldots)$ be a dp-minimal expansion of a non-trivially valued field of characteristic $0$ and $\mathcal{F}$ an infinite field interpretable in $\mathcal{K}$. Assume that $\mathcal{K}$ is one of the following: (i)…

Logic · Mathematics 2021-09-03 Yatir Halevi , Assaf Hasson , Ya'acov Peterzil

We prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field,…

Number Theory · Mathematics 2008-02-27 Kirsten Eisentraeger , Alexandra Shlapentokh

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

A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We adapt arguments originating with Cherlin-van den…

Logic · Mathematics 2023-06-12 Brian Tyrrell