Combinatorics of Thin Posets: Application to Monotone Covering Properties

摘要

A class of posets, called thin posets, is introduced, and it is shown that every thin poset can be covered by a finite family of trees. This fact is used to show that (within ZFC) every separable monotonically Menger space is first countable. This contrasts with the previously known fact that under CH there are countable monotonically Lindelof spaces which are not first countable.