Abstract: We study the determinacy of the game G_kappa (A) introduced in [FKSh:549] for uncountable regular kappa and several classes of partial orderings A. Among trees or Boolean algebras, we can always find an A such that G_kappa (A) is undetermined. For the class of linear orders, the existence of such A depends on the size of kappa^{< kappa}. In particular we obtain a characterization of kappa^{< kappa}= kappa in terms of determinacy of the game G_kappa (L) for linear orders L .
Recommendations
Cites work
Cited in
(11)- Raid games across a set with cyclic order
- The canonical function game
- A trichotomy theorem in natural models of \(\text{AD}^+\)
- A recursion principle for linear orderings
- Determinacy for games ending at the first admissible relative to the play
- Jensen's ⃞ principles and the Novák number of partially ordered sets
- The stationary set splitting game
- Galvin’s “racing pawns” game and a well-ordering of trees
- Partial orderings with the weak Freese-Nation property
- Large normal ideals concentrating on a fixed small cardinality
- scientific article; zbMATH DE number 1827833 (Why is no real title available?)
This page was built for publication: A game on partial orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675112)