The Ehrenfeucht-Fraisse-game of length omega1
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.