加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本