A definable henselian valuation with high quantifier complexity
Immanuel Halupczok, Franziska Jahnke

TL;DR
The paper constructs a parameter-free definable henselian valuation ring that cannot be defined by simple quantifier patterns, answering a question posed by Prestel.
Contribution
It provides the first example of a henselian valuation with high quantifier complexity that is definable without parameters.
Findings
Existence of a parameter-free definable henselian valuation with complex quantifier structure
Answer to Prestel's question on definability patterns
Illustration of limitations in simple definability formulas
Abstract
We give an example of a parameter-free definable henselian valuation ring which is neither definable by a parameter-free -formula nor by a parameter-free -formula in the language of rings. This answers a question of Prestel.
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 Topology and Set Theory · Computability, Logic, AI Algorithms · Rings, Modules, and Algebras
