An undecidability result for the asymptotic theory of -adic fields
arXiv:2105.03771 · doi:10.1016/j.apal.2022.103203
Abstract
Fix a prime . We prove that the set of sentences true in all but finitely many finite extensions of is undecidable in the language of valued fields with a cross-section. The proof goes via reduction to characteristic , adapting Pheidas' proof of the undecidability of with a predicate for powers of . This answers a variant of a question of Derakhshan-Macintyre.
15 pages