An undecidability result for the asymptotic theory of $p$-adic fields
Konstantinos Kartas

TL;DR
This paper proves that the set of sentences true in all but finitely many finite extensions of the p-adic field is undecidable, using a reduction to characteristic p and adapting existing proofs of undecidability.
Contribution
It establishes an undecidability result for the asymptotic theory of p-adic fields, answering a question posed by Derakhshan and Macintyre.
Findings
Undecidability of the asymptotic theory of p-adic fields.
Reduction to characteristic p for the proof.
Extension of Pheidas' method to p-adic fields.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories · Advanced Topology and Set Theory · Mathematical Dynamics and Fractals
