We show in this paper that the theory of ordinal addition of any fixed
ordinal omega(alpha), with alpha less than omega(omega), admits a qua
ntifier elimination. This in particular gives a new proof for the deci
dability result first established in 1965 by R. Buchi using transfinit
e automata. Our proof is based on the Ehrenfeucht games, and we show t
hat quantifier elimination go through generalized power.