Bounded elementary extensions of trees with unbounded paths

Ruaan Kellerman

A tree is a partially ordered set that is downwards linear and downwards connected. A tree is called bounded when each of its paths (i.e. maximal linearly ordered subsets) contains…