Finite Undecidability in Fields I: NIP Fields
Brian Tyrrell

TL;DR
This paper proves that all NIP henselian nontrivially valued fields are finitely undecidable, and under the NIP Fields Conjecture, all NIP fields share this property, advancing the understanding of decidability in field theories.
Contribution
It extends existing constructions to classify NIP henselian fields as finitely undecidable and links this to the broader NIP fields conjecture.
Findings
All NIP henselian nontrivially valued fields are finitely undecidable.
Assuming the NIP Fields Conjecture, all NIP fields are finitely undecidable.
The work connects model-theoretic properties with decidability in field theories.
Abstract
A field in a ring language is finitely undecidable if is undecidable for every nonempty finite . We extend a construction of Ziegler and (among other results) use a first-order classification of Anscombe and Jahnke to prove every NIP henselian nontrivially valued field is finitely undecidable. We conclude (assuming the NIP Fields Conjecture) that every NIP field is finitely undecidable. This work is drawn from the author's PhD thesis.
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
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Logic, programming, and type systems
