A Direct Proof of a Theorem of Telgarsky
From MaRDI portal
Recommendations
Cited in
(19)- The combinatorics of the Baer-Specker group
- Tightness games with bounded finite selections
- A definitive improvement of a game-theoretic bound and the long tightness game
- A minicourse on topological games
- On the instability of a topological game related to consonance
- A direct proof of Jauregui-Tsallis' conjecture
- Winning tactics in a geometrical game
- A direct proof of the theorem on formal functions
- Mycielski ideal and the perfect set theorem
- A direct proof of van der Vaart's theorem
- Applications of limited information strategies in Menger's game.
- The proof of Tchakaloff’s Theorem
- Abstract colorings, games and ultrafilters
- Some remarks on a game of Telgársky
- Selection principles and proofs from the Book
- Omission of intervals: deducing covering properties of subsets of the real line from their combinatorial structure
- Equivalences in selective topological games on the class of dense subsets in the space of continuous functions C_k(X)
- Weak covering properties and infinite games
- A direct proof of Gromov's theorem
This page was built for publication: A Direct Proof of a Theorem of Telgarsky
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4874205)