Covering \mathbb R^{n+1} by graphs of n-ary functions and long linear orderings of Turing degrees
From MaRDI portal
Publication:4813768
Recommendations
- Covering a function on the plane by two continuous functions on an uncountable square -- the consistency
- A very discontinuous Borel function
- Small Coverings with Smooth Functions under the Covering Property Axiom
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
- Covering an additive function by \(< \mathfrak c\)-many continuous functions
Cited in
(6)- A dual open coloring axiom
- Covering an uncountable square by countably many continuous functions
- Weak Borel chromatic numbers
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
- Small Coverings with Smooth Functions under the Covering Property Axiom
- The breadth of constructibility degrees and definable Sierpiński's coverings
This page was built for publication: Covering $\mathbb R^{n+1}$ by graphs of $n$-ary functions and long linear orderings of Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813768)