Partial Order Tree

From GM-RKB
Jump to: navigation, search

A Partial Order Tree is a DAG that is a partially ordered set (T,<=) such that there is an infium of [math]T[/math], and each subset {x in T: x<=y} is finite and is linearly ordered under <=.