Abstract
We study the determinacy of the game Gκ(A) introduced in Fuchino, Koppelberg and Shelah (to appear) for uncountable regular κ and several classes of partial orderings A. Among trees or Boolean algebras, we can always find an A such that Gκ(A) is undetermined. For the class of linear orders, the existence of such A depends on the size of κ<κ. In particular we obtain a characterization of κ<κ = κ in terms of determinacy of the game Gκ(L) for linear orders L.
Original language | English |
---|---|
Pages (from-to) | 141-148 |
Number of pages | 8 |
Journal | Topology and its Applications |
Volume | 74 |
Issue number | 1-3 |
DOIs | |
State | Published - 1996 |
Keywords
- Boolean algebras
- Freese-Nation property
- Games
- Linear orders
- Trees