A game of D. Gale in which one of the players has limited memory

DOI10.1007/BF01946852zbMath0666.03038OpenAlexW2064127250MaRDI QIDQ1116945

Richard Laver, Krzysztof Chris Ciesielski

Publication date: 1990

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01946852

zbMATH Keywords

gamewinning strategyplayer with limited memory

Mathematics Subject Classification ID

2-person games (91A05) Other classical set theory (including functions, relations, and set algebra) (03E20) Determinacy principles (03E60)

Related Items (4)

Variations on a game of Gale. II: Markov strategies ⋮ When does a random Robin Hood win? ⋮ A Ramseyan theorem and an infinite game ⋮ Infinite games on finite sets

Cites Work

• Can you take Solovay's inaccessible away?
• A model of set-theory in which every set of reals is Lebesgue measurable

This page was built for publication: A game of D. Gale in which one of the players has limited memory