English
Related papers

Related papers: Finite Undecidability in Fields II: PAC, PRC and P…

200 papers

Let M be a field of finite type over {\bf Q} and X a variety defined over M. We study when the set {P \in X(K) \mid f^{\circ n} (P) = P for some n \geq 1} is finite for any finite extension fields K of M and for any dominant K-morphisms f :…

Algebraic Geometry · Mathematics 2007-05-23 Shu Kawaguchi

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

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

Computational Complexity · Computer Science 2023-10-18 Matthias C. Caro

The Promise Constraint Satisfaction Problem (PCSP) is a generalization of the Constraint Satisfaction Problem (CSP) that includes approximation variants of satisfiability and graph coloring problems. Barto [LICS '19] has shown that a…

Computational Complexity · Computer Science 2025-06-09 Kristina Asimi , Libor Barto

Let K be an algebraic function field of characteristic 2 with constant field C_K. Let C be the algebraic closure of a finite field in K. Assume that C has an extension of degree 2. Assume that there are elements u,x of K with u…

Number Theory · Mathematics 2016-09-07 Kirsten Eisentraeger

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 the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive…

Logic · Mathematics 2015-02-16 Moshe Jarden , Alexandra Shlapentokh

We show that every definable nested family of closed and bounded subsets of a $P$-minimal field $K$ has non-empty intersection. As an application we answer a question of Darni\`ere and Halupczok showing that $P$-minimal fields satisfy the…

Logic · Mathematics 2020-07-16 Pablo Cubides Kovacsics , Françoise Delon

Let $R$ be a Dedekind ring, $K$ its quotient field, and $L=K(\alpha)$ a finite field extension of $K$ defined by a monic irreducible polynomial $f(x)\in R[x]$. We give an easy version of Dedekind's criterion which computationally improves…

Number Theory · Mathematics 2018-10-09 A. Deajim , L. El Fadil

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

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 consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Logic in Computer Science · Computer Science 2021-09-27 Simon Halfon , Philippe Schnoebelen , Georg Zetzsche

This paper contributes to the study of CPAC learnability -- a computable version of PAC learning -- by solving three open questions from recent papers. Firstly, we prove that every improperly CPAC learnable class is contained in a class…

Computational Complexity · Computer Science 2023-02-24 Valentino Delle Rose , Alexander Kozachinskiy , Cristobal Rojas , Tomasz Steifer

Pop proved that a smooth curve C over an ample field K that has a K-rational point has |K| many K-rational points. We strengthen this result by showing that there are |K| many K-rational points that do not lie in a given proper subfield,…

Algebraic Geometry · Mathematics 2008-11-19 Arno Fehm

We show that the isomorphy type of every finitely generated field $K$ with $\chr(K)\neq2$ is encoded by a \textit{\textbf{single\ha3explicit\ha3axiom}} $\istp K\!$ \textit{\textbf{in\ha3the\ha3language\ha3of\ha3fields}}, i.e., for all…

Algebraic Geometry · Mathematics 2019-01-14 Florian Pop

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

The following conjecture is due to Shelah-Hasson: Any infinite strongly NIP field is either real closed, algebraically closed, or admits a non-trivial definable henselian valuation, in the language of rings. We specialise this conjecture to…

Logic · Mathematics 2022-07-04 Lothar Sebastian Krapp , Salma Kuhlmann , Gabriel Lehéricy

Let $\mathcal M=\langle K;O\rangle$ be a real closed valued field and let $k$ be its residue field. We prove that every interpretable field in $\mathcal M$ is definably isomorphic to either $K$, $K(\sqrt{-1})$, $k$, or $k(\sqrt{-1})$. The…

Logic · Mathematics 2021-05-11 Assaf Hasson , Ya'acov Peterzil

We prove that NIP valued fields of positive characteristic are henselian. Furthermore, we partially generalize the known results on dp-minimal fields to dp-finite fields. We prove a dichotomy: if K is a sufficiently saturated dp-finite…

Logic · Mathematics 2020-01-16 Will Johnson

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