  Tree sets are posets with additional structure that generalize tree-like
objects in graphs, matroids, or other combinatorial structures. They are a
special class of abstract separation systems. We study infinite tree sets and
how they relate to the finite tree sets they induce, and obtain a
characterization of infinite tree sets in combinatorial terms.
