On logical characterization of henselianity

dc.creatorYin, Yimu
dc.date2007-05-03
dc.date2007-05-07
dc.date.accessioned2026-07-07T07:59:28Z
dc.date.available2026-07-07T07:59:28Z
dc.descriptionWe give some sufficient conditions under which any valued field that admits quantifier elimination in the Macintyre language is henselian. Then, without extra assumptions, we prove that if a valued field of characteristic $(0,0)$ has a $\Z$-group as its value group and admits quantifier elimination in the main sort of the Denef-Pas style language $\mathcal{L}_{RRP}$ then it is henselian. In fact the proof of this suggests that a quite large class of Denef-Pas style languages is natural with respect to henselianity.
dc.descriptionMinor corrections
dc.identifierhttps://arxiv.org/abs/0705.0395
dc.identifierhttp://arxiv.org/abs/0705.0395
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128377
dc.subjectLogic
dc.subject03C10;12J10
dc.titleOn logical characterization of henselianity
dc.typetext

Files

Collections