More on the Ehrenfeucht–Fraisse game of length ω1

DOI10.4064/FM175-1-5MaRDI QIDQ4790187zbMATH OpenOpenAlexFDO

Authors Tapani Hyttinen, S. Shelah, Jouko Väänänen

Publication date 28 January 2003

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0212234

zbMATH Keywords

consistency strengthEhrenfeucht-Fraïssé gamestability

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Set-theoretic model theory (03C55) Other infinitary logic (03C75) Consistency and independence results (03E35)

Abstract: Let A and B be two first order structures of the same relational vocabulary L. The Ehrenfeucht-Fraisse-game of length gamma of A and B denoted by EFG_gamma(A,B) is defined as follows: There are two players called for all and exists. First for all plays x_0 and then exists plays y_0. After this for all plays x_1, and exists plays y_1, and so on. Eventually a sequence <(x_beta,y_beta): beta<gamma> has been played. The rules of the game say that both players have to play elements of A cup B. Moreover, if for all plays his x_beta in A (B), then exists has to play his y_beta in B (A). Thus the sequence < (x_beta,y_beta):beta<gamma > determines a relation pi subseteq AxB. Player exists wins this round of the game if pi is a partial isomorphism. Otherwise for all wins. The game EFG_gamma^delta (A,B) is defined similarly except that the players play sequences of length<delta at a time. Theorem 1: The following statements are equiconsistent relative to ZFC: (A) There is a weakly compact cardinal. (B) CH and EF_{omega_1}(A,B) is determined for all models A,B of cardinality aleph_2 . Theorem 2: Assume that 2^omega <2^{omega_3} and T is a countable complete first order theory. Suppose that one of (i)-(iii) below holds. Then there are A,B models T of power omega_3 such that for all cardinals 1<theta<=omega_3, EF^theta_{omega_1}(A,B) is non-determined. [(i)] T is unstable. [(ii)] T is superstable with DOP or OTOP. [(iii)] T is stable and unsuperstable and 2^omega <= omega_3.

Recommendations

• The Ehrenfeucht-Fraisse-Game of Length ω 1
• GAMES OF LENGTH ω₁
• An Ehrenfeucht-Fraïssé game for \(\mathcal L_{\omega_1\omega}\)
• Games of length 2
• Ehrenfeucht-Fraïssé games on omega-terms
• scientific article; zbMATH DE number 5295740
• scientific article; zbMATH DE number 4164956
• Ehrenfeucht-Fraïssé games on ordinals
• On Complexity of Ehrenfeucht-Fraïssé Games
• On complexity of Ehrenfeucht-Fraïssé games

Cited in

(9)

• Theories with Ehrenfeucht-Fraïssé equivalent non-isomorphic models
• Orders of indescribable sets
• Weak Ehrenfeucht-Fraïssé games
• The Ehrenfeucht-Fraisse-Game of Length ω 1
• ON NON-DETERMINED EHRENFEUCHT-FRAÏSSÉ GAMES AND UNSTABLE THEORIES
• 2004 Summer Meeting of the Association for Symbolic Logic
• On the number of automorphisms of uncountable models
• Positional strategies in long Ehrenfeucht-Fraïssé games
• Winning the pressing down game but not Banach-Mazur

This page was built for publication: More on the Ehrenfeucht–Fraisse game of length ω₁

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4790187)