Decidability of positive characteristic tame Hahn fields in Lt
Abstract
We show that any positive characteristic tame Hahn field F((t)) containing t is decidable in Lt, the language of valued fields with a constant symbol for t, if F and are decidable. In particular, we obtain decidability of Fp((t1/p∞)) and Fp((tQ)) in Lt. This uses a new AKE-principle for equal characteristic tame fields in Lt, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.