Ordinal decompositions for preordered root systems

In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These decompositions are examples of ordinal decompositions in relatively normal lattices as introduced by Snodgrass, Tsinakis, and Hart. We conclude the paper with an application to information systems.