Assertion: graph | /r/HasProperty | closed dag
Facets:
value: automatically
type: MANNER
value: transitively
type: MANNER
Source sentences:
text: The same method of translating partial orders into DAGs works more generally: for every finite partially ordered set (S, ≤), the graph that has a vertex for each member of S and an edge for each pair of elements related by u ≤ v is automatically a transitively closed DAG, and has (S, ≤) as its reachability relation.