作者: Tomek Bartoszynski , Winfried Just , Marion Scheepers
关键词:
摘要: Given a free ideal J of subsets set X, we consider games where player ONE plays an increasing sequence elements the σ-completion J, and TWO tries to cover union this by playing one at time from J. We describe various conditions under which has winning strategy that uses only information about most recent k moves ONE, apply some these results Banach-Mazur game