Ehrenfeucht games and ordinal addition (Q1377635): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:09, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ehrenfeucht games and ordinal addition |
scientific article |
Statements
Ehrenfeucht games and ordinal addition (English)
0 references
26 January 1998
0 references
In 1965 R. Büchi proved that the theory of addition of every ordinal is decidable. In the reviewed paper, it is proved that the theory of ordinal addition of any fixed ordinal \(\omega^\alpha\), where \(\alpha< \omega^\omega\), admits a quantifier elimination. The proof is based on Ehrenfeucht games. It is shown that quantifier elimination goes through generalized power.
0 references
ordinal addition
0 references
quantifier elimination
0 references
Ehrenfeucht games
0 references