En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents 13J15 1 results

Filter
Select: All / None
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
A valuation $v$ on a field $K$ is said to be definable (in a specified language) if its corresponding valuation ring is a definable subset of $K$. Historically, the study of definable valuations on certain fields was motivated by the general analysis of definable subsets of fields and related decidability questions, but has also re-emerged lately in the context of classifying NIP fields. In my talk, I will present some recent progress in the study of definable valuations on ordered fields ([1] to [4]), where definability is considered in the language of rings as well as the richer language of ordered rings. Within this framework, the focus lies on convex valuations, that is, valuations whose valuation ring is convex with respect to the linear ordering on the field. The most important examples of such valuations are the henselian ones, which are convex with respect to any linear ordering on the field. I will present topological conditions on the value group and the residue field ensuring the definability of the corresponding valuation. Moreover, I will outline some definability and non-definability results in the context of specific classes of ordered fields such as t-henselian, almost real closed, and strongly dependent ones.[-]
A valuation $v$ on a field $K$ is said to be definable (in a specified language) if its corresponding valuation ring is a definable subset of $K$. Historically, the study of definable valuations on certain fields was motivated by the general analysis of definable subsets of fields and related decidability questions, but has also re-emerged lately in the context of classifying NIP fields. In my talk, I will present some recent progress in the ...[+]

03C64 ; 12J10 ; 13J15 ; 13J30 ; 13F25 ; 12J25

Bookmarks Report an error