EHRENFEUCHT GAMES AND ORDINAL ADDITION

Authors
Citation
F. Maurin, EHRENFEUCHT GAMES AND ORDINAL ADDITION, Annals of pure and applied Logic, 89(1), 1997, pp. 53-73
Citations number
14
ISSN journal
01680072
Volume
89
Issue
1
Year of publication
1997
Pages
53 - 73
Database
ISI
SICI code
0168-0072(1997)89:1<53:EGAOA>2.0.ZU;2-I
Abstract
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.