ranked p0set

ranked p0set

[¦raŋkt ‚pē′zir·ō or ′pē‚səb¦zir·ō ‚set]
(mathematics)
A partially ordered set for which there is a function, r, defined on the elements of the set, such that r (x)=0 if x is a minimal element, and r (x)= r (y)+1 if x covers y.