Covering an uncountable square by countably many continuous functions
From MaRDI portal
Publication:2846860
DOI10.1090/S0002-9939-2012-11292-4zbMath1291.03085arXiv0710.1402MaRDI QIDQ2846860
Benjamin Vejnar, Wiesław Kubiś
Publication date: 3 September 2013
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.1402
03E15: Descriptive set theory
54H05: Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets)
03E05: Other combinatorial set theory
Related Items
Perfect independent sets with respect to infinitely many relations, Forcing and differentiable functions
Cites Work
- Unnamed Item
- Unnamed Item
- Forcing and differentiable functions
- On a construction of universally small sets.
- On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types
- Set theory. An introduction to independence proofs
- Analytic colorings
- A dual open coloring axiom
- Perfect cliques and $G_\delta $ colorings of Polish spaces
- Set Theory
- Covering $\mathbb R^{n+1}$ by graphs of $n$-ary functions and long linear orderings of Turing degrees
- Logic with the quantifier “there exist uncountably many”