Selective strong screenability and a game
classification
🧮 math.GN
keywords
screenabilityselectivestrongconditionsgamespacesstrategywinning
read the original abstract
Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify sufficient conditions for ONE to have a winning strategy, and necessary conditions for TWO to have a winning strategy in the selective strong screenability game
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.