Journal of Symbolic Logic

On Ehrenfeucht-Fraisse Equivalence of Linear Orderings

Juha Oikkonen

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

C. Karp has shown that if $\alpha$ is an ordinal with $\omega^\alpha = \alpha$ and $A$ is a linear ordering with a smallest element, then $\alpha$ and $\alpha \bigotimes A$ are equivalent in $L_{\infty\omega}$ up to quantifer rank $\alpha$. This result can be expressed in terms of Ehrenfeucht-Fraisse games where player $\forall$ has to make additional moves by choosing elements of a descending sequence in $\alpha$. Our aim in this paper is to prove a similar result for Ehrenfeucht-Fraisse games of length $\omega_1$. One implication of such a result will be that a certain infinite quantifier language cannot say that a linear ordering has no descending $\omega_1$-sequences (when the alphabet contains only one binary relation symbol). Connected work is done by Hyttinen and Oikkonen in [H] and [O].

Article information

Source
J. Symbolic Logic, Volume 55, Issue 1 (1990), 65-73.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183743185

Mathematical Reviews number (MathSciNet)
MR1043544

Zentralblatt MATH identifier
0704.03019

JSTOR
links.jstor.org

Citation

Oikkonen, Juha. On Ehrenfeucht-Fraisse Equivalence of Linear Orderings. J. Symbolic Logic 55 (1990), no. 1, 65--73. https://projecteuclid.org/euclid.jsl/1183743185


Export citation