Linear Orderings are a quite general class of orderings which are mathematically interesting from more than one vantage point. They provide important examples in different fields of logic such as model theory and reverse mathematics and one of the most famous problems in the history of set theory, Souslin’s problem is concerned with linear orderings.

The lecture going to cover mostly combinatorial aspects of linear orderings.

These are going to include but might not be restricted to combinatorics of partitions of linear orderings, in particular their Ramsey theory. Other aspect might include problems involving sums or products of ordinals. Depending on the available time, a few theorems might be stated without proof.