We continue the previous lecture and present proofs for some of the new results. We show that \(\diamondsuit\) implies that for any Aronszajn-tree \(T\), there is a ladder system with a 2-colouring with no \(T\)-uniformization. However, if \(\diamondsuit\) holds then for any ladder system \(\mathbf C\) there is an Aronszajn tree \(T\) so that any monochromatic colouring of \(\mathbf C\) has a \(T\)-uniformization.
New aspects of ladder system uniformization II
13.12.2018 15:00 - 16:30
Organiser:
KGRC
Location:
SR 101, 2. St., Währinger Str. 25
Related News:
- 11/29/2018 New aspects of ladder system uniformizationI