We 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 LRRP 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. §1. Introduction. One of the most important tools in model-theoretic algebra is quantifier elimination (QE). Tarski's Theorem laid the foundation for the subsequent work along this line:Theorem 1.1 (Tarski). The theory RCF of real closed fields, as formulated in the language L OR of ordered rings, admits QE.Much later Macintyre proved a very important analog of this result for p-adic fields in [9]: Theorem 1.2 (Macintyre). The theory of p-adic fields, as formulated in the language L Mac , admits QE.A crucial question for the algebraic structure of a field is of course under what conditions polynomials have roots. Properties that answer this question in real closed fields and p-adic fields are essential to the proofs of the above two theorems. They are of course real-closedness and henselianity, respectively. One may raise the question: Is QE equivalent to these properties after all? For real closed fields there is a good answer: Theorem 1.3 (Macintyre, McKenna, van den Dries). Let K be an ordered field such that the theory of K in L OR admits QE. Then K is real closed.This result is established in [10], in which the authors actually give a quite general technique that can be used to establish other similar "converse QE" results for various kinds of fields. In particular they have the following analogous result for p-fields: