Variations on a game of Gale. II: Markov strategies

DOI10.1016/0304-3975(94)90035-3zbMath0809.03042OpenAlexW2070978294MaRDI QIDQ1329737

Marion Scheepers

Publication date: 29 March 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90035-3

zbMATH Keywords

consistencyBaire propertyErdős cardinalMarkov strategytactic

Mathematics Subject Classification ID

2-person games (91A05) Games involving topology, set theory, or logic (91A44) Consistency and independence results (03E35) Set theory (03E99)

Related Items

When does a random Robin Hood win?, Variations on a game of Gale (III): remainder strategies, Infinite games on finite sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stationary strategies in topological games
• Can you take Solovay's inaccessible away?
• A game of D. Gale in which one of the players has limited memory
• Set theory. An introduction to independence proofs
• A Ramseyan theorem and an infinite game
• A model of set-theory in which every set of reals is Lebesgue measurable
• A fine hierarchy of partition cardinals
• A large cardinal in the constructible universe