English
Related papers

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

200 papers

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 extend a construction of Ziegler and (among other…

Logic · Mathematics 2023-07-21 Brian Tyrrell

Fix a prime $p$. We prove that the set of sentences true in all but finitely many finite extensions of $\mathbb{Q}_p$ is undecidable in the language of valued fields with a cross-section. The proof goes via reduction to characteristic $p$,…

Logic · Mathematics 2022-11-14 Konstantinos Kartas

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 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

Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…

Logic · Mathematics 2024-09-04 Carlos Martinez-Ranero , Dubraska Salcedo , Javier Utreras

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

Logic · Mathematics 2017-08-25 Olga Kharlampovich , Alexei Myasnikov

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

We prove the dp-finite case of the Shelah conjecture on NIP fields. If K is a dp-finite field, then K admits a non-trivial definable henselian valuation ring, unless K is finite, real closed, or algebraically closed. As a consequence, the…

Logic · Mathematics 2020-05-29 Will Johnson

We prove the following theorem for a finitely generated field $K$: Let $M$ be a Galois extension of $K$ which is not separably closed. Then $M$ is not PAC over $K$.

Number Theory · Mathematics 2009-07-16 Lior Bary-Soroker , Moshe Jarden

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Logic · Mathematics 2025-12-23 Anupam Das , Abhishek De , Stepan L. Kuznetsov

The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…

Number Theory · Mathematics 2014-07-15 Sunil Chebolu , Keir Lockridge

In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language $b\{0,1\}^*c$. The proof is based on the works of Leonid P. Lisovik.

Formal Languages and Automata Theory · Computer Science 2021-12-01 Vesa Halava

The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…

Logic in Computer Science · Computer Science 2024-04-17 Miroslav Chodil , Antonín Kučera

We prove, assuming resolution of singularities in positive characteristic, an analogue of Siegel's theorem on sum of squares in positive characteristic. The method of proof combines techniques from central simple algebras with model theory…

Logic · Mathematics 2024-10-31 Carlos Martinez-Ranero , Javier Utreras

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Logic · Mathematics 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

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 use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Logic · Mathematics 2011-05-16 Alexandra Shlapentokh , Carlos Videla

It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or…

Logic · Mathematics 2016-08-16 Luck Darnière

Yanchevski\u{i} had asked whether conic bundle surfaces over $\mathbf{P}^1_k$ are unirational when $k$ is a finite field. We give a partial answer to his question by showing that for quasi-finite fields $k$ (e.g. finite fields) a regular…

Algebraic Geometry · Mathematics 2024-12-02 Elyes Boughattas

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
‹ Prev 1 2 3 10 Next ›