Journal of Symbolic Logic 55 (1):65-73 (1990)
|Abstract||C. Karp has shown that if α is an ordinal with ω α = α and A is a linear ordering with a smallest element, then α and $\alpha \bigotimes A$ are equivalent in L ∞ω up to quantifer rank α. This result can be expressed in terms of Ehrenfeucht-Fraïssé games where player ∀ has to make additional moves by choosing elements of a descending sequence in α. Our aim in this paper is to prove a similar result for Ehrenfeucht-Fraïssé games of length ω 1 . One implication of such a result will be that a certain infinite quantifier language cannot say that a linear ordering has no descending ω 1 -sequences (when the alphabet contains only one binary relation symbol). Connected work is done by Hyttinen and Oikkonen in [H] and [O]|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Taneli Huuskonen (1995). Comparing Notions of Similarity for Uncountable Models. Journal of Symbolic Logic 60 (4):1153-1167.
Mati Pentus (1994). The Conjoinability Relation in Lambek Calculus and Linear Logic. Journal of Logic, Language and Information 3 (2):121-140.
Tapani Hyttinen & Jouko Väänänen (1990). On Scott and Karp Trees of Uncountable Models. Journal of Symbolic Logic 55 (3):897-908.
Miklos Ajtai & Ronald Fagin (1990). Reachability is Harder for Directed Than for Undirected Finite Graphs. Journal of Symbolic Logic 55 (1):113-150.
Daniele Mundici (1981). A Group-Theoretical Invariant for Elementary Equivalence and its Role in Representations of Elementary Classes. Studia Logica 40 (3):253 - 267.
Patrick Dehornoy (1990). A Coding of the Countable Linear Orderings. Studia Logica 49 (4):585 - 590.
David Pincus (1997). The Dense Linear Ordering Principle. Journal of Symbolic Logic 62 (2):438-456.
Antonio Montalbán (2005). Up to Equimorphism, Hyperarithmetic Is Recursive. Journal of Symbolic Logic 70 (2):360 - 378.
C. J. Ash (1991). A Construction for Recursive Linear Orderings. Journal of Symbolic Logic 56 (2):673-683.
Juha Oikkonen (1992). A Recursion Principle for Linear Orderings. Journal of Symbolic Logic 57 (1):82-96.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,386 of 722,826 )
Recent downloads (6 months)0
How can I increase my downloads?