What is another word for partially ordered set?
Pronunciation: [pˈɑːʃə͡lˌi ˈɔːdəd sˈɛt] (IPA) 
A partially ordered set is a mathematical structure in which each element is related to some, but not necessarily all, of the other elements. Synonyms for partially ordered sets include poset, partially ranked set, and quasi-order. Additionally, restricted order, semi-order, and incomplete order are other terms that can be used to describe a partial order relationship between elements. Within computer science and database theory, partially ordered sets are referred to as directed acyclic graphs. Regardless of the terminology used, this concept is crucial in mathematics, as it is utilized to model relations between elements in a variety of contexts, including sets of numbers, sets of vectors, and sets of functions.
