We give an example of a parameter-free definable henselian valuation ring which is neither definable by a parameter-free $\forall\exists$-formula nor by a parameter-free $\exists\forall$-formula in the language of rings. This answers a question of Prestel.
We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its value group is stably embedded in its corresponding extension, its residue field is stably embedded in its corresponding extension, and the extension of valued fields satisfies a certain algebraic condition. We show for instance that all types over the Hahn field $\mathbb{R}((\mathbb{Z}))$ are definable. Similarly, all types over the quotient field of the Witt…
We prove the dp-finite case of the Shelah conjecture on NIP fields. If K is a dp-finite field, then K admits a non-trivial definable henselian valuation ring, unless K is finite, real closed, or algebraically closed. As a consequence, the conjectural classification of dp-finite fields holds. Additionally, dp-finite valued fields are henselian. Lastly, if K is an unstable dp-finite expansion of a field, then K admits a unique definable V-topology.
In this paper, we undertake a systematic model and valuation theoretic study of the class of ordered fields which are dense in their real closure. We apply this study to determine definable henselian valuations on ordered fields, in the language of ordered rings. In light of our results, we re-examine the Shelah-Hasson Conjecture (specialised to ordered fields) and provide an example limiting its valuation theoretic conclusions.
Given a henselian valuation, we study its definability (with and without parameters) by examining conditions on the value group. We show that any henselian valuation whose value group is not closed in its divisible hull is definable in the language of rings, using one parameter. Thereby we strengthen known definability results. Moreover, we show that in this case, one parameter is optimal in the sense that one cannot obtain definability without parameters. To this end, we present a construction method for a $t$-henselian non-henselian ordered field elementarily equivalent to a henselian field …
Universität Zürich（苏黎世大学）；Fachbereich Mathematik und Statistik, Universität Konstanz（康斯坦茨大学数学与统计系）；Institut für Interdisziplinäre Sprachevolutionswissenschaft, Universität Zürich（苏黎世大学跨学科语言进化科学研究所）
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure, both algebraic and definable closure with respect to that collection are $Σ^0_{n+2}$ sets. We further show that these bounds are tight.
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of definable relations as those preserved by isomorphisms of substructures, the second one also providing a formula in the positive case. Our approach also includes the design of an algorithm that computes the isomorphism type of a tuple in a finite algebraic structure. Proofs of soundness and completeness of the algorithms are presented, as well as empirical te…
