The Ehrenfeucht-Fraisse-game of length omega1
Alan H. Mekler, Saharon Shelah, Jouko Väänänen
Abstract
Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fraisse-game of length omega1 of A and B which we denote by Gomega1(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game of Lomega omega except that there are omega1 moves. It is clear that Gomega1(A,B) is determined if A and B are of cardinality <= aleph1. We prove the following results: Theorem A: If V=L, then there are models A and B of cardinality aleph2 such that the game Gomega1(A,B) is non-determined. Theorem B: If it is consistent that there is a measurable cardinal, then it is consistent that Gomega1(A,B) is determined for all A and B of cardinality <= aleph2. Theorem C: For any kappa >= aleph3 there are A and B of cardinality kappa such that the game Gomega1(A,B) is non-determined.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf