The aim of this talk is to review certain uniformization properties of ladder systems on \(\omega_1\). In particular, we focus on a machinery (of iterating a family of simple non proper posets) developed by Shelah investigating the Whitehead problem under CH. Our main interest lies in using this technique to construct uncountably chromatic graphs with interesting/unexpected behavior.
Uniformization properties in connection to graph colourings
03.12.2015 15:00 - 16:30
Organiser:
KGRC
Location:
SR 101, 2. St., Währinger Str. 25