Almost compatible functions and infinite length games
Steven Clontz, Alan Dow
Source record
Source: Crossref
Published: Apr 1, 2018
DOI: 10.1216/rmj-2018-48-2-463
Open original source ↗Source abstract
asserts the existence of pairwise almost compatible finite-to-one functions for each countable subset of . The existence of winning -Markov strategies in several infinite-length games, including the Menger game on the one-point Lindelofication of , are guaranteed by . is implied by the existence of cofinal Kurepa families of size , and thus, holds for all cardinals less than . It is consistent that fails; however, there must always be a winning -Markov strategy for the second player in the Menger game on .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.