Meager-Nowhere Dense Games (II): Coding Strategies

DOI10.2307/2048661MaRDI QIDQ3358729zbMATH OpenOpenAlexFDO

Authors Marion Scheepers

Publication date 1991

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2048661

zbMATH Keywords

coding strategynowhere dense setsrandom gamewinning strategy

Mathematics Subject Classification ID

Descriptive set theory (03E15)

Recommendations

• MEAGER-NOWHERE DENSE GAMES (V): CODING STRATEGIES AGAIN
• Variations on a game of Gale (III): remainder strategies
• Meager-nowhere dense games. I: n-tactics
• Variations on a game of Gale (I): Coding strategies
• scientific article; zbMATH DE number 528926

Cited in

(8)

• Meager-nowhere dense games. I: n-tactics
• Meager sets, games and singular cardinals
• Evasion and prediction. V: Unsymmetric game ideals, constant prediction, and strong porosity ideals
• Variations on a game of Gale (I): Coding strategies
• MEAGER-NOWHERE DENSE GAMES (V): CODING STRATEGIES AGAIN
• Error recognition in the Cantor cube
• Rapidly varying sequences and rapid convergence
• Classes of sequences of real numbers, games and selection properties

This page was built for publication: Meager-Nowhere Dense Games (II): Coding Strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358729)