Decidability of positive characteristic tame Hahn fields in $\mathcal{L}_t$
Victor Lisinski

TL;DR
This paper proves the decidability of positive characteristic tame Hahn fields in the language of valued fields, leveraging a new AKE-principle and results from automata theory and algebraic extensions.
Contribution
It introduces a new AKE-principle for tame fields in positive characteristic within the language al_t, extending decidability results to specific Hahn fields.
Findings
Decidability of al_t for certain tame Hahn fields
A new AKE-principle for equal characteristic tame fields
Extension of AKE-principle to mixed characteristic tame fields
Abstract
We show that any positive characteristic tame Hahn field containing is decidable in , the language of valued fields with a constant symbol for , if and are decidable. In particular, we obtain decidability of and in . This uses a new AKE-principle for equal characteristic tame fields in , building on work by Kuhlmann, together with Kedlaya's work on finite automata and algebraic extensions of function fields. In the process, we obtain an AKE-principle for tame fields in mixed characteristic.
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
TopicsMathematical Dynamics and Fractals · Algebraic Geometry and Number Theory · Cellular Automata and Applications
